c常用算法的实现经典代码。

一个用来计算矩阵运算的函数库，希望对大家有用-One used to calculate the matrix operations of the library and hope for all of us

独立于AVL库的存储媒体 虽现在有不少可用的AVL树库，但几乎都是工作在RAM中，当数据量小的时候，这种方式可行，但当树结构变大时时，读取和存储的时间就会大大变长，任务效率大大降低。能不能直接用磁盘进行树的操作呢？若可以，就不必进行频繁的磁盘内存交换了，本程序就实现了这个功能。实际上，这个程序无论是磁盘还是内存，都很好用。-independent of the AVL storage media is now available in a number of the AVL tree, But almost all work in the RAM, when a small amount of data, this approach feasible, but big tree structure constant, read and storage time will be much longer and the task efficiency has been greatly reduced. Can directly use the disk tree operation? If so, there is no need for frequent exchange of disk memory, the process to achieve this function. In fact, this procedure is disk or memory, are very handy.

QR二维码生成器与解码器的C++实现，其中QREncode.zip压缩文件是生成器，QRcodeDecode.zip文件是解码器，文件是完整的，在VC++环境下编译可以直接通过。

逐次超松驰迭代法(Successive Over Relaxation Me thod,简称SOR方法)是高斯―塞德尔方法的一种加速方法，是解大型稀疏矩阵方程组的有效方法之一，它具有计算公式简单，程序设计容易,占用计算机内存较少等优点,但需要较好的加速因子(即最佳松驰因子).下面我们首先说说松驰一词的含意,再利用它来解释雅可比迭代法与高斯―塞德尔迭代法,最后给出逐次超松驰迭代法的推算公式和收敛性条件.-Successive over relaxation iteration method (Successive Over Relaxation Me thod, called SOR method) is the Gauss- Seidel method for an accelerated method is solution of large sparse matrix equations, one effective method, it has a simple formula, programming easy, take up less computer memory, etc., but the need for better acceleration factor (that is, the best relaxation factor). Let us first talk about the meaning of the term relaxation, and then use it to explain the Jacobi s iterative method and the Gauss- Seidel iterative method, and finally gives successive over relaxation iterative method of projection formula and the convergence condition.

primepalindrome，找回文素数的一个不错的算法实现-primepalindrome, retrieve the text of a good prime number algorithm

这是操作系统的一个课程设计，是关于生产者－消费者的一个模拟算法。- This is an operating system curriculum designs, is about a producer- consumer s simulation algorithm.

军团问题， 某国家在一条战线上（一条直线）上部署了n 支军队。如果两支或两支以上军队相邻，它们将形成一个军团。如果一支军队不和任何一支军队相邻，那么它也是一个独立的团。给定一组军队在战线上左右两端的位置及编号，求出所有的军团 -Corps issues, a country in a front (a straight line) on n-support forces deployed. If two or more than two neighboring armies, they will form a regiment. If an army is not adjacent to any one army, then it is also an independent regiment. Given a group of troops on the front left and right ends of the location and number, find all of the Army

实验目的与实验环境 掌握曲线拟合的最小二乘法 探求拟合函数的选择与拟合精度间的关系 实验环境 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

九维的卡尔曼滤波跟踪算法，包括xyz三方向和各方向的位置，速度，加速度。-Nine-dimensional Kalman filter tracking algorithm, including the three xyz direction and the location of the direction, velocity, acceleration.

生成球体表面均匀分布的点的程序- Production spheroid surface even distribution spot procedure