I had a question comparing the two algorithms:Boyer Moore and Boyer Moore Horspool.

I understand what they do but I just want to see how they differ in any way if there are any differences.

From my understanding, the bad character heuristic stage of the Boyer Moore algorithm is essentially the same as Boyer Moore Horspool algorithm? Because I believe all that Horspool did was take the suffix stage out of BM and only used the bad character stage for his algorithm.

So does that make the bad character heuristic stage of the Boyer Moore algorithm essentially the same as Boyer Moore Horspool algorithm? Like process and code wise.

I understand the efficiency is a little bit different.

Thank you

0 Answers