Fast Hybrid Algorithm (Single String Search String Search)
Jump to navigation
Jump to search
Time Complexity
$O(n+m)$+ $O(m+s)$
Space Complexity
$O(m)$ words
(Derived: Uses three tables, each of size $O(m)$)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2017
Reference
https://thesai.org/Downloads/Volume8No6/Paper_15-Fast_Hybrid_String_Matching_Algorithm.pdf