Boyer Moore Algorithm
Jan 25, 2021
The Boyer Moore algorithm is a searching algorithm in which a string of length n and a pattern of length m is searched. It prints all the occurrences of the pattern in the Text.
Like the other string matching algorithms, this algorithm also preprocesses the pattern.
Boyer Moore uses a combination of two approaches — Bad character and good character heuristic. Each of them is used independently to search the pattern.
In this algorithm, different arrays are formed for both heuristics by pattern processing, and the best heuristic is used at each step. Boyer Moore starts to match the pattern from the last, which is a different approach from KMP and Naive.
