Word.ws English Dictionary

Boyer-Moore-Horspool algorithm

Boyer-Moore-Horspool algorithm proper noun: 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.

Proper noun

the Boyer-Moore-Horspool algorithm

  1. 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.

Synonyms of Boyer-Moore-Horspool algorithm

Origin of Boyer-Moore-Horspool algorithm

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

Questions about Boyer-Moore-Horspool algorithm

What does Boyer-Moore-Horspool algorithm mean?
Boyer-Moore-Horspool algorithm means 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.
What part of speech is Boyer-Moore-Horspool algorithm?
Boyer-Moore-Horspool algorithm is a proper noun.

Words near Boyer-Moore-Horspool algorithm in the dictionary

  1. boyeen
  2. boyeens
  3. boyehs
  4. boyer
  5. Boyer-Ahmad
  6. Boyer-Moore-Horspool algorithm
  7. boyers
  8. Boyes
  9. Boyes Hot Springs
  10. Boyett
  11. Boyette

Source and license

Adapted from Wiktionary: Boyer-Moore-Horspool algorithm (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “Boyer-Moore-Horspool algorithm.” Word.ws, https://word.ws/boyer-moore-horspool_algorithm. Based on Wiktionary, CC BY-SA 4.0.