Knuth–Morris–Pratt algorithm
- A string-searching algorithm that searches for occurrences of a “word“
W within a main “text string” S by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to determine where the next match could begin, thus bypassing re-examination of previously matched characters. ← Wikipedia
- More about this term (beta): Web search, articles and videos, books
- Previous term: Knowledge Graph
- Next term: Konqueror
- Random term: Segregation of duties