数值算法，二分搜索演示

的 PageRank 是链接分析算法和它分配数值加权的每个元素超链接 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

这是用贪心算法实现对会议的智能安排，里面包括建立贪心算法的步骤化实现及快速排序经典算法-This is a greedy algorithm with intelligent arrangements for the meeting, which included the establishment of greedy algorithm and steps to achieve and fast classical algorithm for sorting

计算Pi的程序, 是老程序了, 不过很牛. 值得收藏!-Pi calculation procedures, the old procedures, but very cattle. Copies!

应用背景 SIMPLE CODE TO DRIVE AN MULTIPLEXED LCD 关键技术 It is a basic driver code to initialize and excecute the LCD

C++常用算法，给计算方法中各种基本应用提供参考-C common algorithms for calculation method to provide the basic reference

关于约瑟夫环的两种思考方法 -Josephus on the two way of thinking

bp算法-bp 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.

用并行编程语言MPI编写整数加法程序。

Capacitated 设施选址问题 (CFLP) 是简单的工厂选址问题的推广。来，我们现在，假设每个设施可以产品的生产数量有限。它是相当普遍的假设和重要性。虽然这些问题的数学模型不是很有区别，但解决方法为 CFLP 是更加困难。CFPL 的最有效方法是 Lagrangen 放松的方法和矩阵的列生成方法.