Romberg

说明：  实现基2时域频域抽取fft算法，可输出运算后所得复序列的模值序列，并可记录显示计算所用时间(Achieve base 2 fft algorithm frequency domain extraction can be obtained after computing the output sequence of modulus of complex sequences can be used in the calculation time, records show)

21位水仙花数的寻找，里面用到了大数乘法等细节上的东西。(find the 21 digits narcissus.)

可进行最小二乘法线性拟合输出，包含源代码及生成后的程序(Least-squares linear fit can be output)

说明：  此程序为满足条码不能带IOQ三位字母的计算方法(Bar code can not be three letters with the calculation of IOQ)

关于汉诺塔的代码,中间是用迭代的方法实现的(About Hanio Tower)

很好用的单导线平差，具有单线的计算能力 可以已知两点或者方位角开始计算(Very good adjustment with a single wire, with one-way computing power can be known to start two or azimuth)

用C＋＋实现的高斯混合模型的算法类，方差矩阵是对角矩阵(C++ Gaussian mixture model algorithm category, variance matrix is diagonal matrix)

MFC编写的计算器，基本功能都已实现，加速键没有实现(Written in MFC calculator, basic functions have been achieved, not achieved accelerator)

矩阵转换问题 行与列的个数均为n 的矩阵称为n 阶方阵。假定矩阵中的每个元素的值在0到9之间，则可以将矩阵中的所有元素按行依次排列得到一个“单行矩阵字符串”。(Matrix conversion, the number of rows and columns of the matrix n are called n-order square. Assume that each element of matrix value in the 0 to 9, you can press all the elements of the matrix rows in order of priority for a " single matrix string." )

一个仓本模型计算程序，用于计算奇异态和序参量(a program of kuramotto)