numerical comparison to judge whether two equal number greater than or less than

*   To factor the n by n matrix A = (A(I,J)) into the product of the*   lower triangular matrix L = (L(I,J)) and U = (U(I,J)), that is*   A = LU, where the main diagonal of either L or U consists of all ones:**   INPUT:   dimension n; the entries A(I,J), 1

递归计算众数，重数，输入一个整形数组，用递归计算数组中出现次数最多的数（众数）以及出现次数（重数）。-Recursive calculation mode, re-number, enter an integer array, with the recursive computation of the array appear in the highest number of number (plural), and the number of occurrences (multiplicity).

应用背景正则表达式关键技术添加两个文件转换到DOS UNIX换行符

Concrete_Mathematics_2nd_Ed_TeX_Source_Code

此此例子是搜索，是对图的搜索的学习。This example is search, the search for figure of learning

资源描述在本资源中提供了基数排序的实现源码，并附有相应的注释，在vs2012中可以成功编译运行。

用牛顿法解非线性方程组(包括论文及源程序)-with Newton method for solving systems of nonlinear equations (including papers and source)

用高斯-赛德尔迭代法求方程组的根。它的原理与简单迭代法相似，但在赛德尔迭代法中，每次迭代时充分利用当前最新的迭代值-With the Gauss- Seidel iterative method seeking the roots of equations. Its principle with simple iterative method similar, but the Seidel iteration method in each iteration to take full advantage of the current value of the latest iteration

作为数值计算中稳定性很好的，同时求解激波很准确的求解格式-The stability of numerical calculation as well, at the same time very accurate solution of shock wave solving format

这个程序是一个Win32程序，计算Fibonacci斐波纳契数列(一种整数数列, 其中每数等于前面两数之和)。其定义是f(1) = 1，f(2) = 2，并且当n>2时， f(n) = f(n-1) + f(n-2)。源代码种给出了三种计算方法。第一种方法用递归，第二种方法用大数组，第三种方法用小数组。此外，这个程序还具备多线程特性，所以在运算时可以做其它操作。代码用到了以前创建的Win32类。测试为发现bug和内存溢出。--Calculate Fibonacci value.