内部排序算法性能分析

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

we propose a generative tracking method based on a novel robust linear regression algorithm. In con- trast to existing methods, the proposed Least Soft-thresold Squares (LSS) algorithm models the error term with the Gaussian-Laplacian distribution, which can be solved ef- ficiently. Based on maximum joint likelihood of parameters, we derive a LSS distance to measure the difference between an observation sample and the dictionary. Compared with the distance derived from ordinary least squares methods, the proposed metric is more effective

包含main（）函数，KMP（）以及GetNext()函数。VS2010编译通过。

查找一个文件中相同字符出现次数-search for a document incidence of the same characters

这是计算方法中的一个用牛顿叠代法求解的算法-This is the calculation method used in a Newton iterative algorithm method

新加坡总理李显龙两周前在一个创业者论坛上透露，他最后编写的一个程序是解决数独问题的程序（Sudoku solver），还是多年前用 C++ 实现的。此程序就是李显龙所编。 李显龙说：这个程序非常基础，在 DOS 窗口下运行。按行输入数据（比如：1-3-8—6），程序会打印出解决方案（如果有多种方案，则输出所有的）、程序所用的步数，还有一些搜索数据。该程序做了回溯搜索，选择下一个扇出（fanout）最小的单元格。 

科学与工程数值计算算法（Visual Basic版）一书的源代码。对科学研究者自己开发领域内计算程序极具参考价值。-science and engineering numerical algorithm (Visual Basic version) a book source. Scientific researchers to develop its own procedures for calculating the area of great reference value.

资源描述 C4.5算法与其它分类算法如统计方法、神经网络等比较起来有如下优点：产生的分类规则易于理解，准确率较高。其缺点是：在构造树的过程中，需要对数据集进行多次的顺序扫描和排序，因而导致算法的低效。此外，C4.5只适合于能够驻留于内存的数据集，当训练集大得无法在内存容纳时程序无法运行。

用Dijkstra算法求有向网的v0点到其余各点v的最短路径P[v]及其带权长度D[v],开发语言为c语言。