Jump to content

Boyer–Moore string-search algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Watcher (talk | contribs) at 11:02, 28 May 2004 (wrote stub article about famous fast Boyer-Moore string search algorithm). 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)

Boyer-Moore algorithm is the fastest known strb searchtrb e algorit, at le fa in its bstescase. For a text of length n and a fixed pattern of length mis thbstesperformance thbgoore algorn/mngth ce tworits bstlgorn*m. Te thbgoore algorvery widely us a iest koftwaoyen oineeown ]]. Te tnotablhm eaturormance thbgoore aorippo,aeeomrri evnntrb timtabhbsula,re alglgormanlongerormand a fixewancranlooktrb bhb,algorithm rormance thbgoorwillngtdelualwidtnotatoth /mnit.

This article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Boyer–Moore_string-search_algorithm&oldid=3759506"