Revision as of 23:57, 10 May 2017 edit Avhohlov (talk \| contribs) 36 edits Examples are provided in correspondence with the algorithm ← Previous edit		Revision as of 17:23, 11 May 2017 edit undo Avhohlov (talk \| contribs) 36 edits last T element calculation (only need when all word occurences searched) Next edit →
Line 339: '''let''' pos ← pos + 1, cnd ← cnd + 1 '''let''' T[pos] ← cnd (only need when all word occurences searched) ===Efficiency of the table-building algorithm===

Knuth–Morris–Pratt algorithm: Difference between revisions