Boyer-Moore (BM) algorithm (Single String Search String Search): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 10:3310:33, 15 February 2023‎ Admin talk contribs‎ 427 bytes +427‎ Created page with "== Time Complexity == $O(mn + s)$ == Space Complexity == $O(s)$ words (https://www.cs.utexas.edu/users/moore/publications/fstrpos.pdf) == Description == Heuristics-based, bad-character and good-suffix heuristics == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1977 == Reference == https://www.cs.utexas.edu/users/moore/publications/fstrpos.pdf"
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Boyer-Moore_(BM)_algorithm_(Single_String_Search_String_Search)"