• 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

1. Related terms: Rabin–Karp algorithm · Unicode Bidirectional Algorithm · String literal
2. Previous term: Knowledge Graph
3. Next term: Konqueror
4. Random term: WXSS (webglossary.info/random 🎲)