Knuth–Morris–Pratt algorithm: Difference between revisions

Revision as of 01:35, 16 October 2017

Revision as of 21:14, 16 October 2017

Line 144:

'''let''' i ← i + 1

'''if''' i = length(W) '''then'''

(occurrence found, if only first occurrence needis needed, m may be returned at this point)

'''let''' P[nP] ← m, nP ← nP + 1

'''let''' m ← m + i - T[i], i ← T[i] (T[length(W)] can't be -1)