Boyer-Moore-Horspool (BMH) (Single String Search String Search)

From Algorithm Wiki

Revision as of 11:14, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(mn + s)$ == Space Complexity == $O(s)$ words (Derived: Uses a bad-character shift table of size $O(s)$) == Description == Bad-character heuristic == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1980 == Reference == https://onlinelibrary-wiley-com.ezproxy.canberra.edu.au/doi/abs/10.1002/spe.4380100608")

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

Jump to navigation Jump to search

Time Complexity

$O(mn + s)$

Space Complexity

$O(s)$ words

(Derived: Uses a bad-character shift table of size $O(s)$)

Description

Bad-character heuristic

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1980

Reference

https://onlinelibrary-wiley-com.ezproxy.canberra.edu.au/doi/abs/10.1002/spe.4380100608

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Boyer-Moore-Horspool_(BMH)_(Single_String_Search_String_Search)&oldid=45244"