The Boyer-Moore-Horspool algorithm, or Horspool's algorithm, finds substrings within strings and was published by Nigel Horspool in 1980 as a simplification of the Boyer-Moore string-search algorithm. It trades space for time to reach an average-case complexity of O(n) on random text, though its worst case is O(nm), where m is the length of the pattern and n the length of the string being searched.
Facts
Time Complexity
Time Complexity (category) Connections
In Field
Source Boyer-Moore-Horspool algorithm (Wikipedia)
Invented By
The Boyer-Moore-Horspool algorithm is a simplification of the Boyer-Moore string search algorithm, which J Strother Moore co-published with Robert S. Boyer in 1977.
The Boyer-Moore-Horspool algorithm is a simplification of the Boyer-Moore string search algorithm, which Robert S. Boyer co-published with J Strother Moore in 1977.
Sources
1. Boyer-Moore-Horspool algorithm (Wikipedia)
Lead sectionQuote, Lead section
In computer science, the Boyer-Moore-Horspool algorithm or Horspool's algorithm is an algorithm for finding substrings in strings.
Boyer-Moore-Horspool algorithm (Wikipedia)
In Field: Algorithms and Complexity Theory, Lead sentence
Boyer-Moore-Horspool algorithm or Horspool's algorithm is an algorithm for finding substrings in strings.
In Group: String Searching Algorithms, Lead section
algorithm for finding substrings in strings
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.