• A string-searching algorithm that uses hashing to find an exact match of a pattern string in a text. It uses a rolling hash to quickly filter out positions of the text that cannot match the pattern, and then checks for a match at the remaining positions. A practical application of the Rabin–Karp algorithm is plagiarism detection. The algorithm was presented in 1987 by Richard M. Karp and Michael O. Rabin. ← Wikipedia

1. Related terms: Unicode Bidirectional Algorithm · Partial exact-match domain · Knuth–Morris–Pratt algorithm
2. Previous term: RAB
3. Next term: Race condition
4. Random term: CodeRabbit (webglossary.info/random 🎲)