求解非线性方程组的一个高效算法，用FORTRAN实现.

在 java 应用程序，开发了这个程序。Apriori 算法用来找出频繁项集和支持和最低限度的信心

C语言冒泡法(起泡法)排序 思路：将相邻的两个数进行比较，将小的调到前头。 如果有n个数，那么要进行n-1次的比较。在第一次比较中要进行n-1次的两两比较，在第j次比较中要进行n-j次的两两比较。 过程：先通过动态赋值的方法，把用户输入的10个数字保存到数组中。 用两个for循环语句，外层循环是限制次数，内层循环限制某次要进行两两比较的次数。 如果a[n]>a[n+1]，那么将两个数进行交换。

在3DIC設計中會使用的方法  Floorplanning is an important and dispensable stage in the traditional integrated circuit design process. With the raised module numbers and increased wire length, the computation complexity is raised dramatically. Obviously, the traditional algorithms need to be updated. We developed an orthogonal table, in which each factor represents a module and the level of a specified factor denotes the orientation of that module. With this orthogonal table, the solution space is significantly decreased.  We use sequence pair to represent a floorplan and the fast longest common subsequence is used accordingly to calculate the area of

FPgrowth is the one of the algorithm in frequent item set mining. It is used to find the frequent item set in a database. It will give the output in tree structure format. It is more efficient than apriori algorithm because there is no candidate generation. 

机器学习决策树经典C4.5java源码单机版  包括信息商计算 和决策树图打印两大部分

朱兆祺同学的学习笔记，很强大。 举几个例子给大家看下：   1. ＃include< >和＃include" "有什么区别？ 这个题目考查大家的基础能力，＃include< >用来包含开发环境提供的库， ＃include" "用来包含.c/.cpp文件所在目录下的头文件。注意：有些开发环境可以在当前目录下面自动收索（包含子目录），有些开发环境需要指定明确的文件路径名。 1.2 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

河内塔的数学解析。用VisualC++编写

Microsoft CryptoAPI  可以自己看看                   ！

用matlab求解的一个Lagrange插值多项式问题-Using matlab to solve the problem of a Lagrange interpolation polynomial

解非线性方程组的一种方法：先用一种优化方法将给定初值（它有可能会使得后续的牛顿法发散）通过一条比较快的途径收敛到精确解附近，得到一个新的初始点，然后再通过牛顿法将新的初始点迭代到精确解（一定的误差范围内）。这种方法的优点在于：它可以将牛顿法快速收敛的优势发挥出来，同时又避免了该方法收敛域比较窄的缺点。-solving nonlinear equations in a way : by using a method of optimizing initial Givens (it might make follow-up to Newton"s law divergence) adopted a relatively fast convergence to the channel near the exact solution, to be a new starting point, and then Newton"s law of the new iteration of the initial point of the exact solution ( some of error). This method has the advantage : it can be rapid convergence of Newton"s method to exploit the advantages while avoiding convergence of the method is relatively narrow domain shortcomings.