tree

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

a very easy .c file for calculating the products of ints

用C语言程序通过先随机选取K个对象作为初始的聚类中心。然后计算每个对象与各个种子聚类中心之间的距离，把每个对象分配给距离它最近的聚类中心。聚类中心以及分配给它们的对象就代表一个聚类。一旦全部对象都被分配了，每个聚类的聚类中心会根据聚类中现有的对象被重新计算。(C Programming Language by first randomly selected the K object as initial cluster centers. And then calculate the distance between each object and each seed cluster center, and assign each object to its nearest cluster center. Cluster centers, and the object assigned to them on behalf of a clustering. Once all the objects are assigned to each cluster cluster centers will be based on the existing object clustering is recalculated.)

The Fast Hartley Transform (FHT) implementation.

模拟退火算法，地球物理反演，非线性反演算法(Simulated annealing algorithm)

测绘程序，计算测边网各点坐标的评查程序，值得借鉴(Mapping program to calculate the coordinates of each point measured the side-netting of assessment investigative procedures, worth learning)

惩罚函数法C语言相关程序 它将有约束最优化问题转化为求解无约束最优化问题：其中M为足够大的正数， 起"惩罚"作用， 称之为罚因子，F(x, M )称为罚函数。(Penalty Function Method C language-related program it would have constrained optimization problem is transformed into solving unconstrained optimization problem: where M is a sufficiently large positive number, from the " punishment" effect, called the penalty factor, F (x, M) called the penalty function.)

一个个人使用的精简了的c++有限元计算库(Finite element calculation library)

最小二乘法拟合曲线C++代码，任意的M个数据，任意的次数N(N不易太高)。输出拟合曲线的表达式(Least Squre For ...)

研究生动力学课程，计算多体动力学课程， 学习起来有点难度，如果有兴趣就看看吧(Graduate dynamics course)