Revision as of 17:59, 13 December 2004 edit Antaeus Feldspar (talk \| contribs) 17,763 edits cleanup notice ← Previous edit		Revision as of 07:13, 14 December 2004 edit undo Antaeus Feldspar (talk \| contribs) 17,763 edits →Notes on the Algorithm Next edit →
Line 108: The [[complexity]] of searching the string for the given pattern is o(''n'') where ''n'' is the length of the main string. ==External links== *[http://www.ics.uci.edu/~eppstein/161/960227.html An explanation of the algorithm] [[Category:Algorithms on strings]]

Knuth–Morris–Pratt algorithm: Difference between revisions