计算方法 NEWTON插值的C程序

Quick hull implementation

数据挖掘经典算法————ID3 算法，JAVA实现，可运行，适合初学者

求解序列二次规划程序，只要编写不同的目标函数，目标函数导数，约束函数，约束函数的雅克比矩阵，即可求出不同问题的最大值或最小值。Solving sequence quadratic programming, as long as write a different objective function, the target function and constraint function, constraint function of Jacobi matrix, then find out the maximum or minimum of a different question.

VC实现的MD5加密算法源码，包括完整的VC代码，可用VC6打开，编译调试，还包括测试数据和测试用例，可直接拿来使用，有很高的利用价值。也是从其他地方下载的，忘记是哪里下载的了。

(用Euler法和改进的Euler法求解，用三阶Adams外插法及内插法求解 -(Using Euler method and the improved Euler Method, using third-order Adams extrapolation method and interpolation method for solving

利用C++完成计算方法的分段线性，二次插值和全区间拉格朗日插值的计算！-C completed the calculation method piecewise linear, quadratic interpolation, and the region between the Lagrange interpolation calculation!

一个很好用的常用数学分布实现代码集合-a good use of mathematical distribution achieve common pool code

点集凸包Gram扫描法 c++程序-point set convex hull Gram scanning procedures c

200495231612.rar

求解大型疏松方程组，ap方程组的系数矩阵，b[放回解向量-For solving large loose equations, ap equations coefficient matrix, b [back into the solution vectors