Knuth-Morris-Pratt Algorithm

• Utilize a prefix array $\pi$[1..m], where $\pi$[q] contains information to compute $\delta$(q, a) for (a $\in$ $\Sigma$), the pattern shift for a mismatch on P[q].

  
  

  
  

• $\pi$ requires only O(m) time (as opposed to O(m ) for $\delta$).