50 Algos In 50 Weeks: Implementing Boyer–Moore string search algorithm

In computer science (http://en.wikipedia.org/wiki/Computer_science), the Boyer–Moore string search algorithm is an efficient string searching algorithm (http://en.wikipedia.org/wiki/String_searching_algorithm) that is the standard benchmark for practical string search literature.[1] (http://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm#cite_note-0) It was developed by Robert S. Boyer (http://en.wikipedia.org/wiki/Robert_S._Boyer) and J Strother Moore (http://en.wikipedia.org/wiki/J_Strother_Moore) in 1977.[2] (http://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm#cite_note-original-1) The algorithm (http://en.wikipedia.org/wiki/Algorithm) preprocesses (http://en.wikipedia.org/wiki/Preprocessor) the string (http://en.wikipedia.org/wiki/String_(computer_science)) being searched for (the pattern), but not the string being searched in (the text). It is thus well-suited for applications in which the text does not persist across multiple searches. The Boyer-Moore algorithm uses information gathered during the preprocess step to skip sections of the text, resulting in a lower constant factor than many other string algorithms. In general, the algorithm runs faster as the pattern length increases.