资源列表
vandermond
- 范德蒙行列式求解方法,VANDER(X[],W[],Q[],N),在子过程Vander中实现。-Vandermonde determinant solution, VANDER (X [], W [] [] Q, N), Vander-in process to achieve.
12
- 计算弧长的公式，需要输入弦、半径。联系方式：ybybzgy◎126.com
MCMPFFT
- 嵌入式程序中的fft算法代码，详细输入输出内容参见程序说明-Embedded program code fft algorithm in detail the contents of input-output descr iption of the procedures, see
sort
- Sorting algorithm for study
Jacobi
- 简单迭代法(Jacobi跌代法)，输入方程的维数、迭代最高次数、误差范围、方程的系数矩阵、常数矩阵，然后进行简单迭代法(Jacobi)迭代求解。-A simple iteration method (Jacobi or on behalf of the Law), enter the equation of the dimension, the maximum number of iterations, error range, equation coefficient matrix, cons
cPPRK4
- 计算微分方程组的C++程序，主要利用了龙哥库塔方法-Calculation of differential equations
DistanceOfBag
- multiple instance 距离计算-multiple instance
JiaoBing
- 实现数组的自动随机创建，并且可以求得俩数组集合的交集和并集-Array automatically randomly created, and you can obtain the intersection of the two array set and set
fortran
- 高斯完全主元素消元法，经过测试可以使用，防止主元绝对值偏小情况-Gaussian completely the main element elimination method has been tested and can be used, to prevent the principal component of the absolute value is too small
beibao
- 一个背包问题的启发式算法，在处理小数据时可以快速得到结果。-A heuristic algorithm for knapsack problem, in dealing with small data can quickly get results.
Hungary-algorithm-
- 利用增广路径，求二部图的最大匹配的匈牙利算法-The Hungary maximum matching algorithm of Bipartite graph.
code
- ACM数论代码：矩阵快速幂题目的c++源码-ACM game Number Theory Code: Matrix quickly c++ power source