遗传算法的源程序，用于多组分样品的拉曼光谱的分析的C语言原程序...

由于简单模式匹配算法在一次字符比较失败后，简单的把模式串位置向前移动一个字符位置，这样就丢掉了前面字符匹配中得到的信息，效率差。所以就需要一种无回溯的算法来提高效率，这里使用KMP（Knuth-Morris-Pratt）算法。模式串前面的连续片断部分称“前缀模式”，前缀模式在模式串后部重复出现的情况可以用来避免重复进行已经做过的检查，这是KMP算法中的一个重要概念。-as simple pattern-matching algorithm to compare a character failure, a simple model put forward position Series mobile location of a character, would be lost in front of characters matching the information inefficiently. There is a need for a non-backtracking algorithms to improve efficiency, the use of KMP here (Knuth-Morris-Pratt) algorithm. Model Series in front of a row clips part said "prefix model," prefix string pattern in the pattern of recurring back can be used to avoid duplication of inspection has been done, KMP algorithm is an important concept.

求乘积最大的子序列乘积,采用动态规划方法求解-product for the greatest sequences product using dynamic programming method for

一个很好的矩阵类，使用者用了请务必感谢原作者-a good matrix type, users spent Be sure to thank the original author! !

实现哈希表的建立,插入等功能,并用初留余数法构造,处理冲突-Realize hash wish foundation of form , function of meddling in etc. , and with leave remainder law construct for the first time, deal with the conflict

约瑟夫环的问题.采用循环链表来解决...简单-Joseph Ring issue. ... Using circular linked list to solve a simple ....

该程序用于在一个给定的数组中寻找素数，它使用一个1很经典的算法，效率很高。-the procedures used in a given array of finding prime numbers, it uses one of a classic algorithms, high efficiency.

图的深度优先遍历和广度优先遍历，以邻接矩阵方式输入。（按照提示输入）！ -map the depth and breadth traversal priority priority traverse to the adjacency matrix input. (According to the prompt entry)!

很好的系统,vc++ + ASSSE 系统-good system, vc ASSSE system

简单的通讯录程序-simple correspondence procedures

100个vfp 小程序源码，对于初学者来说很有用-100 -100 VFP applet source code, useful for beginners-100