Knuth–Morris–Pratt algorithm: Difference between revisions

Revision as of 18:35, 6 February 2005

Revision as of 18:38, 6 February 2005

Line 164:

++i;

} else if (j > 0) {

j = T[j - 1];

} else {

T[i + 1] = 0;

Line 170:

j = 0;

}

c = TP[j];

}