Boyer-Moore

The Boyer-Moore algorithm finds a pattern in a string. It was developed by Bob Boyer and J. Strother Moore.

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