Boyer-Moore Algorithm

The Boyer-Moore string-search algorithm is an efficient method for finding occurrences of a pattern within a body of text, and has become the standard benchmark against which other practical string-search algorithms are measured. It preprocesses the search pattern itself, rather than the text being searched, matching characters from the end of the pattern backward and skipping ahead by more than one character at a time when a mismatch occurs, which makes it especially effective when the pattern is much shorter than the text or is reused across many searches. It was developed by Robert S. Boyer and J Strother Moore in 1977. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/