CalcActivationCode

说明：  距阵链乘问题: 找出矩阵链乘A(35*40) A(40*20) A(20*10) A(10*15)的最佳相乘次序。 算法来自:计算机算法导引(matrix chain by : identify matrix chain by A (35* 40) A (40* 20) A (20* 10) A (10* 15) concludes the best order. Algorithm from : computer algorithm Seeker)

对平面上给定的多点进行多项式曲线的拟合，可设置拟合多项式的次数(Given more points on the plane polynomial curve fitting, you can set the number of polynomial fitting)

LM3S例程系列，非常实用。 代码稍加修改即可使用。(LM3S routine series, very practical. The code is slightly modified can be used.)

This is a Stack Class with Funtions Push,Pop, check Stack is Full or Empty Application: Change a number from Decimal to Binary

用吉尔方法积分一阶微分方程组的初值问题。(Gill method with integral equations of first order initial value problem.)

很好很实用的信号处理程序。适合学习和科研参考使用。(Very good very useful signal processing. Suitable for learning and scientific research use and reference.)

多项式拟合，最小二乘法，c++版本实现，运行环境vc6(Polynomial fitting)

求解四元三次方程组，通过在VC++的编程环境，实现计算的高速运行(Solving four yuan cubic equations by VC++ programming environment, to achieve high-speed operation calculated)

说明：  Neville插值算法，xa为自变量数组，xy为因变量数组；x为待插值的自变量(Neville interpolation algorithm, xa array as variables, xy array as the dependent variable x for the independent variables to be interpolated)

计算复序列的分裂基快速傅里叶变换，分裂基快速算法是将基2和基4分解组合而成。在基2M类快速算法中，分裂基算法具有最少的运算量，且仍保留结构规则、原位计算等优点。(Calculate complex sequence of split radix fast Fourier transform, fast algorithm is to split the base base 2 and base 4 decomposition combination. 2M fast algorithm in the base class, the split-based algorithm has the least amount of computation and structural rules remain in situ calculation and so on.)