udoprog/bgrep2 — Issue #1: Implement Boyer-Moore String Searching
Author: udoprog
Created: 2011-12-09 10:24:06+00:00
State: open

The current algorithm is quite inneficient, landing at about a constant runtime performance of (n - m) * m (m being the length of the input string).

Boyer-Moore could improve this with a best case of n / m which would be very beneficial on long input strings.

http://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm