Boyer–Moore–Horspool algorithm
In computer science, the Boyer–Moore–Horspool algorithm or Horspool's algorithm is an algorithm for finding substrings in strings. It was published by Nigel Horspool in 1980. It is a simplification of the Boyer–Moore string search algorithm which is related to the Knuth–Morris–Pratt algorithm. The algorithm trades space for time in order to obtain an average-case complexity of O(N) on random text, although it has O(MN) in the worst case, where the length of the pattern is M and the length of the search string is N.
Wikipage disambiguates
primaryTopic
Boyer–Moore–Horspool algorithm
In computer science, the Boyer–Moore–Horspool algorithm or Horspool's algorithm is an algorithm for finding substrings in strings. It was published by Nigel Horspool in 1980. It is a simplification of the Boyer–Moore string search algorithm which is related to the Knuth–Morris–Pratt algorithm. The algorithm trades space for time in order to obtain an average-case complexity of O(N) on random text, although it has O(MN) in the worst case, where the length of the pattern is M and the length of the search string is N.
has abstract
In computer science, the Boyer ...... gth of the search string is N.
@en
L'algorithme de Boyer-Moore-Ho ...... ne recherchée et ∑ l'alphabet.
@fr
Алгоритм Бойера — Мура — Хорсп ...... то 3|haystack| у Бойера-Мура).
@ru
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
743,763,623
hypernym
type
comment
In computer science, the Boyer ...... gth of the search string is N.
@en
L'algorithme de Boyer-Moore-Ho ...... ne recherchée et ∑ l'alphabet.
@fr
Алгоритм Бойера — Мура — Хорсп ...... то 3|haystack| у Бойера-Мура).
@ru
label
Algorithme de Boyer-Moore-Horspool
@fr
Boyer–Moore–Horspool algorithm
@en
Алгоритм Бойера — Мура — Хорспула
@ru