From Algorithmist
Jump to navigation Jump to search

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

Time Complexity[edit]

The algorithm's time complexity is if and are the lengths of the pattern and the text. This is better than the trivial solution and the solution offered by Knuth-Morris-Pratt.

External Links[edit]

This is a stub or unfinished. Contribute by editing me.