Apostolico–Giancarlo Algorithm (Single String Search String Search)
Jump to navigation
Jump to search
Time Complexity
$O(m + s)$ + $O(n)$
Space Complexity
$O(m)$ words
(https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1456&context=cstech&sei-redir=1)
Description
Variant of BM
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1986
Reference
https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1456&context=cstech&sei-redir=1