Description: In computer science, Boyer-Moore string search algorithm is a very efficient string searching algorithm. It consists of Bob Boyer and J Strother Moore design in 1977. This algorithm only to search the target string (keywords) pretreatment, instead of a string to be searched. Although the execution time of Boyer-Moore algorithm also depends linearly on the size of the string being searched, but usually only a small part of other algorithms: it does not need to be searched in the character string for each comparison and will skip some. Usually the search key is longer, the faster algorithm. Its efficiency comes from the fact that the algorithm can use as much information as possible to exclude as many non matching positions as possible for each failed matching attempt.
To Search:
File list (Check if you may need any files):
BM算法.cpp
Download