Naïve string-search algorithm (Single String Search String Search)

From Algorithm Wiki

Revision as of 10:33, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(m(n-m+{1}))$ == Space Complexity == $O({1})$ words (Derived (pointer algorithm)) == Description == Linear searching == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference == -")

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

Jump to navigation Jump to search

Time Complexity

$O(m(n-m+{1}))$

Space Complexity

$O({1})$ words

(Derived (pointer algorithm))

Description

Linear searching

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1940

Reference

-

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Naïve_string-search_algorithm_(Single_String_Search_String_Search)&oldid=44435"