Boyer-Moore
← Back to Pattern Matching
A string matching algorithm that scans the pattern right-to-left and uses bad character and good suffix heuristics to skip large portions of text. Sublinear in practice for natural language text. O(n/m) best case, O(nm) worst case.