Boyer Moore Algorithm Implementation?

问题

Is there a working example of the Boyer-Moore string search algorithm in C? I've looked at a few sites, but they seem pretty buggy, including wikipedia.

Thanks.

回答1:

The best site for substring search algorithms:

http://igm.univ-mlv.fr/~lecroq/string/

回答2:

There are a couple of implementations of Boyer-Moore-Horspool (including Sunday's variant) on Bob Stout's Snippets site. Ray Gardner's implementation in BMHSRCH.C is bug-free as far as I know¹, and definitely the fastest I've ever seen or heard of. It's not, however, the easiest to understand -- he uses some fairly tricky code to keep the inner loop as a simple as possible. I may be biased, but I think my version² in PBMSRCH.C is a bit easier to understand (though definitely a bit slower).

¹ Within its limits -- it was originally written for MS-DOS, and could use a rewrite for environments that provide more memory.
² This somehow got labeled as "Pratt-Boyer-Moore", but is actually Sunday's variant of Boyer-Moore-Horspool (though I wasn't aware of it at the time and didn't publish it, I believe I actually invented it about a year before Sunday did).

来源：https://stackoverflow.com/questions/5423886/boyer-moore-algorithm-implementation