Knuth-Morris-Pratt algorithm

He was a co-discoverer of the Knuth-Morris-Pratt algorithm for string-search.

Vaughan Pratt, computer scientist (co-creator of the Knuth-Morris-Pratt algorithm)

It is a simplification of the Boyer-Moore string search algorithm which is related to the Knuth-Morris-Pratt algorithm.

Two famous examples are the Boyer-Moore and Knuth-Morris-Pratt algorithms, and several algorithms based on the suffix tree data structure.

Assuming the prior existence of the table , the search portion of the Knuth-Morris-Pratt algorithm has complexity O(n), where is the length of and the is big-O notation.

Rabin-Karp is inferior for single pattern searching to Knuth-Morris-Pratt algorithm, Boyer-Moore string search algorithm and other faster single pattern string searching algorithms because of its slow worst case behavior.

The Knuth-Morris-Pratt algorithm, which Pratt designed in the early 1970s together with fellow Stanford professor Donald Knuth and independently from Morris, is still the most efficient general string searching algorithm known today.