使用贪婪算法 解决0－1背包问题MATLAB源代码

vs2005开发的apriori算法程序，实现算法的基本功能，获取关联规则-apriori algorithm vs2005 development process, achieve the basic functions of algorithm to obtain association rules

卡尔曼滤波源码-Kalman filter source

一些比较经典的数学问题源程序 包括百鸡百钱，灯塔问题，桃子猴问题-some of the more classic source of mathematical problems, including 100 hundred chickens money, Lighthouse, peach monkey issue

这是扬辉三角的算法-Jan- 1.30 Algorithm

逐次超松驰迭代法(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.

GNU的数值运算库,内容丰富!-GNU numerical arithmetic library, a rich content!

这是一个程序，用分形方法构建一个简单的树（生长王涛） 运行该程序，并双击鼠标在客户端领域，那么 简单的树将被显示在屏幕上。一个有趣的事情是，如果你 再次双击，用不同的appreance一个新的树将建成。

使用递归实现的快速排序法-Quick sort using recursive

Taflove 的FDTD算法的经典书籍，非常值得期待的FDTD教程。相信大家喜欢-Taflove the FDTD algorithm is the classic book, well worth looking forward to the FDTD tutorial. I believe that everyone likes

资源描述 在codeblocks平台上面运用C语言来描述，实现输入十进制数转换为二进制数进行输出。文件包里面包括整个工程，下载即用。 此程序适合各种数值间的转换。