Boyer-Moore-Horspool algorithm

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

English Wikipedia has an article on:
Wikipedia

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
Retrieved from "https://en.wiktionary.org/w/index.php?title=Boyer-Moore-Horspool_algorithm&oldid=77942057"