Knuth–Morris–Pratt algorithm: Difference between revisions

Content deleted Content added
Jaredwf (talk | contribs)
re-categorise
Line 107:
The [[complexity]] of searching the string for the given pattern is o(''n'') where ''n'' is the length of the main string.
 
[[Category:Algorithms on strings]]