Jump to content

Boyer–Moore–Horspool algorithm

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 129.242.16.229 (talk) at 13:02, 17 April 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Horspool's algorithm is a simplification of the Boyer-Moore algorithm which is related to the Knuth-Morris-Pratt algorithm.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Boyer–Moore–Horspool_algorithm&oldid=12430072"