Boyer-Moore-Horspool algorithm

Hello, you have come here looking for the meaning of the word Boyer-Moore-Horspool algorithm. In DICTIOUS you will not only get to know all the dictionary meanings for the word Boyer-Moore-Horspool algorithm, but we will also tell you about its etymology, its characteristics and you will know how to say Boyer-Moore-Horspool algorithm in singular and plural. Everything you need to know about the word Boyer-Moore-Horspool algorithm you have here. The definition of the word Boyer-Moore-Horspool algorithm will help you to be more precise and correct when speaking or writing your texts. Knowing the definition ofBoyer-Moore-Horspool algorithm, as well as those of other words, enriches your vocabulary and provides you with more and better linguistic resources.

English

Etymology

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

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