To clarify, my understanding is that Boyer-Moore should work in that it would produce correct output, but the benefit over brute force diminishes toward disappearance as the alphabet gets smaller. Is that what you're seeing?
In reply to Re: Why Boyer-Moore, Horspool, alpha-skip et.al don't work for bit strings. (And is there an alternative that does?)
by mr_mischief
in thread Why Boyer-Moore, Horspool, alpha-skip et.al don't work for bit strings. (And is there an alternative that does?)
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |