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.

Similar
Horspool's algorithm
Ask AI about this wordChatGPTClaudePerplexityGoogle AIGrok

Meanings

proper nounthe Boyer-Moore-Horspool algorithm
  1. computerAn 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: Horspool's algorithm

Synonyms & antonyms

proper nounAn algorithm for finding substrings that trades space for time in order to obtain an average-case time complexity of O(n) on random text.

Similar
Horspool's algorithm
Also see
horspool's algorithm

Origin

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

Full word history & related roots →
Cite this entry
APA

Boyer-Moore-Horspool algorithm. (n.d.). In WatkinsX Dictionary. Retrieved November 3, 2026, from https://dictionary.watkinsx.com/word/Boyer-Moore-Horspool%20algorithm

MLA

“Boyer-Moore-Horspool algorithm.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Boyer-Moore-Horspool%20algorithm. Accessed November 3, 2026.

Chicago

WatkinsX Dictionary, s.v. “Boyer-Moore-Horspool algorithm,” accessed November 3, 2026, https://dictionary.watkinsx.com/word/Boyer-Moore-Horspool%20algorithm.

Source: Boyer-Moore-Horspool algorithm on Wiktionary, CC BY-SA 4.0.