School operations, the mine self

频繁项集挖掘采用spark实现的并行化挖掘算法（并行的apriori算法和b并行的  fp_growth算法）。并行的apriori算法采用scala编写，并行的fpgrowth采用java编写。里面会有较多函数使编程的内容。                                                                                                                                             &

改代码对于学习数据结构和算法来说是必不可少的书籍，代码中提供了各种类型算法的详细程序

一个自己写的列主元高斯消去法，用Matlab实现-Wrote it myself out of a PCA Gaussian elimination, using Matlab realize

基于哈夫曼编码的实现-based on the achievement of Huffman coding

c语言的数值算法挺好的!!非常的好!! 包括线性规划,二乘法-c language numerical algorithm is very good! ! Very good! ! Including linear programming, Multiplication .................... 2

关于非线性方程和非线性方程组的根的数值算法和程序！-On the nonlinear equations and nonlinear equations of the numerical algorithm of the root and procedures!

它是一个 c 程序 tokmiser 你必须给 c 程序输入 tokensise 。这是基本的 c 程序 tokensiser

某银行提供10个服务窗口(7个对私服务窗口，3个对公服务窗口)和100个供顾客等待的座位。顾客到达银行时，若有空座位，则到取号机上领取一个号，等待叫号。取号机每次仅允许一位顾客使用，有对公和对私两类号，每位顾客只能选取其中一个。当营业员空闲时，通过叫号选取一位顾客，并为其服务。

资源描述此程序是利用回溯法的思想，来解决N皇后问题。利用Ｃ＃语言进行开发，可以更加直观的观察回溯法的运用步骤。

One of the world-wide cooperative computing tasks is the "Grand Internet Mersenne Prime Search" -- GIMPS -- striving to find ever-larger prime numbers by examining a particular category of such numbers. A Mersenne number is defined as a number of the form (2p–1), where p is a prime number -- a number divisible only by one and itself. (A number that can be divided by numbers other than itself and one are called "composite" numbers, and each of these can be uniquely represented by the prime numbers that can be multiplied together to generate the composite number — referred to as its prime factors.) Initially it looks as though the Mersenne numbers are all primes. Prime Corresponding Mersenne Number 2 4–1 = 3 -- prime 3 8–1 = 7