Editing Knuth–Morris–Pratt algorithm (section)

===Description of pseudocode for the search algorithm===
<!--Note to future editors: please do not replace or even supplement the pseudocode with language-specific code.  Following the WikiProject Computer Science manual of style, pseudocode is preferred over real code unless the real code illustrates a feature of the language or an implementation detail.  This algorithm is so simple that neither of these can ever be the case-->
The above example contains all the elements of the algorithm.  For the moment, we assume the existence of a "partial match" table <code>T</code>, described [[#"Partial match" table (also known as "failure function")|below]], which indicates where we need to look for the start of a new match when a mismatch is found.  The entries of <code>T</code> are constructed so that if we have a match starting at <code>S[m]</code> that fails when comparing <code>S[m + i]</code> to <code>W[i]</code>, then the next possible match will start at index <code>m + i - T[i]</code> in <code>S</code> (that is, <code>T[i]</code> is the amount of "backtracking" we need to do after a mismatch).  This has two implications: first, <code>T[0] = -1</code>, which indicates that if <code>W[0]</code> is a mismatch, we cannot backtrack and must simply check the next character; and second, although the next possible match will ''begin'' at index <code>m + i - T[i]</code>, as in the example above, we need not actually check any of the <code>T[i]</code> characters after that, so that we continue searching from <code>W[T[i]]</code>.  The following is a sample [[pseudocode]] implementation of the KMP search algorithm.
 '''algorithm''' ''kmp_search'':
     '''input''':
         an array of characters, S (the text to be searched)
         an array of characters, W (the word sought)
     '''output''':
         an array of integers, P (positions in S at which W is found)
         an integer, nP (number of positions)
 
     '''define variables''':
         an integer, j ← 0 (the position of the current character in S)
         an integer, k ← 0 (the position of the current character in W)
         an array of integers, T (the table, computed elsewhere)
 
     '''let''' nP ← 0
 
     '''while''' j < length(S) '''do'''
         '''if''' W[k] = S[j] '''then'''
             '''let''' j ← j + 1
             '''let''' k ← k + 1
             '''if''' k = length(W) '''then'''
                 (occurrence found, if only first occurrence is needed, m ← j - k  may be returned here)
                 '''let''' P[nP] ← j - k, nP ← nP + 1
                 '''let''' k ← T[k] (T[length(W)] can't be -1)
         '''else'''
             '''let''' k ← T[k]
             '''if''' k < 0 '''then'''
                 '''let''' j ← j + 1
                 '''let''' k ← k + 1