A named algorithm operating on sequences of characters or symbols, matching, comparing or extracting structure from them. Belongs here: Boyer-Moore Algorithm and Longest Common Subsequence Algorithm, each defined over string or sequence input. Does not belong here: an algorithm that happens to process text as a side effect but whose defined problem is not itself about string structure, such as a general search or sort applied to a list of strings.
Facts
Comparison
Era of Emergence Browse By
Sources
1. Wikipedia: Knuth-Morris-Pratt algorithm
WikipediaKnuth-Morris-Pratt algorithm, History sectionQuote, Knuth-Morris-Pratt algorithm, History section
The three also published the algorithm jointly in 1977.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.