Looking for good programming challenges?

Use the search below to find our solutions for selected questions!

Boyer–Moore string search algorithm

Sharing is caring!

The Boyer–Moore string search algorithm is an efficient string searching algorithm that is the standard benchmark for practical string search literature. For instance, GNU grep uses the Boyer-Moore algorithm.

For a full explanation of the algorithm please refer to Wikipedia.