资源列表
maxk
- 最大Ｋ乘积大家看着用吧 多余的就不多说了
Radix2_FFT
- Radix-2（基2）操作的FFT程序，适用于任意点数的FFT运算-Radix-2 (base 2) operation of the FFT program, for any point of the FFT
a
- 该代码为拉格朗日插值方法的C程序源代码，通俗易懂，很好的实现了拉格朗日插值，精确度较高-The code for the Lagrange interpolation of the C source code, easy to understand, to achieve a good Lagrange interpolation, higher precision
gsdl
- 用fortran编写的高斯赛德尔迭代法。用的是fortran90 版本-Gauss Seidel iterative method
pingyibianhuan
- 自己编写的关于图像作各种变换的程序，给大家借鉴一下。-I have written procedures for various transformations on the image for everyone to learn from it.
matlab_kmeans
- k-means无监督机器学习聚类算法，使得同聚类中的记录欧式距离最小。-K-means machine learning method without instruction, minilizing the distances of records in each clusters the.
complex
- The arithmetical operations of two complex numbers by their real and imaginary parts individually.
BRINV
- 最用全选主元商斯-约当(Gauss-Jordan ) 法求在矩阵的逆矩阵.-About when the Method in inverse matrix- most with full pivoting Suppliers Sri Lanka.
2-10
- 可将二进制装换为十进制，支持浮点数据，有效位数可以自己设定。-Installed binary converted to decimal, support for floating-point data, the effective number of bits can be set.
0-1Jump
- 用动态规划去解答0-1背包问题，此方法是在经典背包问题上进行的跳跃点优化而解答出来的，已成功通过编译调试-Using dynamic programming to answer 0-1 knapsack problem, this method is carried out on the classic knapsack problem jumps out optimization solutions, has successfully passed the compiler debugging
Knight-tOUR
- Knight tour algorihtms, C-Knight tour algorihtms, C++
saler
- 动态规划解决tsp问题，初学者使用，测试城市建议少于10个，调试环境为vs2013。-Dynamic programming to solve tsp problem, beginners, recommended that fewer than 10 test cities, debugging environment for vs2013.