# Boyer-Moore

The algorithm's time complexity is ${\displaystyle O(m/n)}$ if ${\displaystyle n}$ and ${\displaystyle m}$ are the lengths of the pattern and the text. This is better than the trivial ${\displaystyle O(nm)}$ solution and the ${\displaystyle O(n+m)}$ solution offered by Knuth-Morris-Pratt.