Single String Search

Single string search algorithms try to find a place where a string (also called a pattern) is found within a larger string or text.

Parameters

Filters

Displaying 14 of 14 algorithms


Fast Hybrid Algorithm	2017	$O(n+m+s)$	$O(m)$
Quick-Skip Searching	2012	$O(mn)$	$O(m)$
BOM (Backward Oracle Matching)	1999	$O(mn)$	$O(m)$
Tuned Boyer-Moore algorithm	1991	$O(mn)$	$O(m + s)$
Two-way String-Matching Algorithm	1991	$O(n + m)$	$O(1)$
Raita Algorithm	1991	$O(mn + s)$	$O(s)$
Rabin-Karp (RK) algorithm	1987	$O(mn)$	$O(1)$
Apostolico–Giancarlo Algorithm	1986	$O(m + s + n)$	$O(m)$
Boyer-Moore-Horspool (BMH)	1980	$O(mn + s)$	$O(s)$
Knuth-Morris-Pratt (KMP) algorithm	1977	$O(m+n)$	$O(m)$
Boyer-Moore (BM) algorithm	1977	$O(mn + s)$	$O(s)$
Bitap algorithm	1964	$O(mn)$	$O(m)$
Naïve string-search algorithm	1940	$O(m(n-m+1))$	$O(1)$
String-Matching with Finite Automata	1940	$O(mn)$	$O(m)$

Insuffient Data to display table

Insuffient Data to display table