ACM Some topics have a certain degree of difficulty. But also to do some.

*   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

数据挖掘经典FP-growth算法C源码实现-Data Mining the classical FP-growth algorithm C source code to achieve

数据挖掘中的聚类算法程序演示参考 dbscan for C# -data mining algorithms procedures demonstration dbscan reference for C#

一般输出三角图形需要两个循环，输出菱形需要四个循环，这里只用一个for循环就实现了菱形图形的输出。

用c#做的计算器小程序，包括+-*/等计算，并加入了平方，开根号，log，ln等，接近大家的使用习惯

通过一个简单的实例，实现一个C语言的经典算法，而且这个代码在我们实践中，也会经常用到，并将其进行模板话，这样就可以随时拿来使并可以将其封装成一个固有的库来实现

Delphi中的很有用的一组控件的源代码.-Delphi"s very useful in a group control the source code.

数理统计Stutent s检验源代码，应用Visual C#编写。-Mathematical Statistics Stutent s test source code, the application of Visual C# Prepared.

数值分析中的简单迭代法求方程根问题（迭代公式为[sqrt(x+1)]），程序中含方程输入和根显示界面。-Numerical analysis of a simple iterative method for equation of the root problems (iterative formula is [sqrt (x+ 1)]), process input and root equation containing display.

Gauss-seid迭代法-Gauss- Seid iterative method