资源列表
min
- 最小二乘算法 可以进行非线性优化 是智能计算中一种很有用的算法-the algorithm for nonlinear optimization is a useful intelligent computing algorithm
GS
- 利用VC++6.0进行高斯-赛德尔（Gauss-Siedel）迭代法进行齐次非线性方程组的计算，对于初学C++的人来说，本程序十分有用。方程的系数在程序中定义。-To use VC++6.0 Gauss- Seidel iterative method (Gauss-Siedel) homogeneous nonlinear equations calculated, the program is useful for beginners C++ people. The coefficients
huishui
- 利用C++语言，进行DEM中汇水的计算。在程序中初始设定的DEM中每个格的值，进行坡度坡向的计算。是学习GIS初学者很好的代码！-Use C++ language, the calculation of the DEM catchment. DEM initial set in the program each cell' s value, the calculation of slope and aspect. Learning GIS beginners a good code!
log2.c.tar
- C code to comupute the integer-based log2 of a number. It uses two methods and compare the results.
continued_fractions.tar
- A small tool to compute the continued fraction that best approximates a given float number. Useful for finding the approzimation and to express how well a given number could be approximated with a fraction.
1
- 改编自IGRF，能够计算全球地磁场的数值，课选择单点或者全球某个经纬范围内-Adapted from IGRF, be able to calculate the value of the global geomagnetic field, Lesson select a single point or a global latitude and longitude range withincu
final-matlab
- this the source code for Matlab & simulink for digital communication. this folder contains all the matlab code in the textbook.-this is the source code for Matlab & simulink for digital communication. this folder contains all the matlab code in the t
Copy-of-searchco
- This file with name Binary search tree create optimal binary search tr-This file with name Binary search tree create optimal binary search tree
Binary-tree
- create optimal binary search tr-create optimal binary search tree
Binary-tree1
- This file create optimal binary search tr-This file create optimal binary search tree
Bin3ary-tree
- This file with name "Binary search tree.cpp" create optimal binary search tree.
Create-a-Binary-Tree-dynamic
- This file with name "Binary search tree.cpp" create optimal binary search tr-This file with name "Binary search tree.cpp" create optimal binary search tree