Raita Algorithm (Single String Search String Search)

From Algorithm Wiki
Revision as of 12: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 == Slight variation of BMH == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1991 == Reference == https://www.cin.ufpe.br/~paguso/courses/if767/bib/Raita_1992.pdf")
(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

Slight variation of BMH

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1991

Reference

https://www.cin.ufpe.br/~paguso/courses/if767/bib/Raita_1992.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Raita_Algorithm_(Single_String_Search_String_Search)&oldid=45243"