Revision as of 02:46, 24 September 2017 edit 166.104.63.83 (talk) There does not exist the third branch. Tag: Visual edit ← Previous edit		Revision as of 05:17, 2 October 2017 edit undo 24.4.216.36 (talk) →Description of pseudocode for the search algorithm Next edit →
Line 144: (occurrence found, we may return m or store/use m and prepare for next search) '''return''' m '''let''' m ← m + i - T[i], i ← T[i] (T[length(W)] can't be -1) '''else''' '''if''' T[i] > -1 '''then'''

Knuth–Morris–Pratt algorithm: Difference between revisions