Knuth-Morris-Pratt (KMP) algorithm (Single String Search String Search)

From Algorithm Wiki

Revision as of 08:54, 10 April 2023 by Admin (talk | contribs)

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

Jump to navigation Jump to search

Time Complexity

$O(m+n)$

Space Complexity

$O(m)$ words

(https://pdfs.semanticscholar.org/4479/9559a1067e06b5a6bf052f8f10637707928f.pdf)

Description

Automaton-based

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1977

Reference

https://pdfs.semanticscholar.org/4479/9559a1067e06b5a6bf052f8f10637707928f.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Knuth-Morris-Pratt_(KMP)_algorithm_(Single_String_Search_String_Search)&oldid=46924"