Two-way String-Matching 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(n + m)$ == Space Complexity == $O({1})$ words (http://monge.univ-mlv.fr/~mac/Articles-PDF/CP-1991-jacm.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1991 == Reference == http://monge.univ-mlv.fr/~mac/Articles-PDF/CP-1991-jacm.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n + m)$

Space Complexity

$O({1})$ words

(http://monge.univ-mlv.fr/~mac/Articles-PDF/CP-1991-jacm.pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1991

Reference

http://monge.univ-mlv.fr/~mac/Articles-PDF/CP-1991-jacm.pdf

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