title: native string matching algorithm
body: <p>Following is a very famous question in native string matching. Please can someone explain me the answer.   </p>
  
  <p><strong>Suppose that all characters in the pattern P are different. Show how to accelerate NAIVE-STRING MATCHER to run in time O(n) on an n-character text T.</strong></p>