Knuth-Morris-Pratt Algorithm Definition
A linear-time algorithm that searches for occurrences of one text string within another, employing the observation that when a mismatch occurs, the search string itself embodies sufficient information to determine where the next match could begin, thus reducing the number of possible match locations that must be checked.
Origin of Knuth-Morris-Pratt Algorithm
The algorithm was conceived in 1970 by Donald Knuth and Vaughan Pratt, and independently by James H. Morris.
Find Similar Words
Find similar words to Knuth-Morris-Pratt algorithm using the buttons below.