Boyer-Moore-Horspool algorithm

English

edit

Etymology

edit

It was published by Nigel Horspool in 1980, and based on an earlier (1977) algorithm developed by Robert S. Boyer and J. Strother Moore.

Proper noun

edit

the Boyer-Moore-Horspool algorithm

  1. (computing theory) An algorithm for finding substrings that trades space for time in order to obtain an average-case time complexity of O(n) on random text.
    Synonym: Horspool's algorithm