KMP 算法是由Knuth，Morris和Pratt等人共同提出的，所以成为Knuth－Morris－Pratt算法，简称KMP算法。KMP算法是字符串模式匹配中的经典算法。和BF算法相比，KMP算法的不同点是匹配过程中，主串的位置指针不会回溯，这样的结果使得算法时间复杂度只为O（n＋m）。

采用VC++开发，实现KMP字符串匹配算法-KMP algorithm by Knuth, Morris and Pratt, who co-sponsored, so as Knuth-Morris-Pratt algorithm, called KMP algorithm. KMP algorithm is a classical string pattern matching algorithm. And the BF algorithm is compared, KMP algorithm is different from the matching process, the location of the main string pointer will not go back, this result makes the algorithm time complexity only O (n+ m). Using VC++ development, implementation KMP string matching algorithm