Revision as of 14:02, 18 May 2004 edit Chadernook (talk \| contribs) 159 edits No edit summary ← Previous edit		Revision as of 21:58, 1 June 2004 edit undo Jaredwf (talk \| contribs) 1,674 edits Category:Algorithms Next edit →
Line 106: The [[complexity]] of searching the string for the given pattern is o(''n'') where ''n'' is the length of the main string. [[Category:Algorithms]]

Knuth–Morris–Pratt algorithm: Difference between revisions