CS 3341, Recitation Section, Problem list 2.  For Jan 27, 29.

   Consider the String Matching Problem on pages 104-105
   of your text.  Specifically one has a Text Array T
   and a Pattern Array P:
      char T[n];
      char P[m];
   and m < n.  We want to find all the characters of P as
   a substring of the characters of T.
   
1. Go over the algorithm of the book and see that it works.

2. See what the worst case bound on this algorithm's
   performance is.
   
3. How many comparisons are needed in looking for the
   patterns below in the text below (problem 5 of page 106):

   T is 1000 0's and the P is
      a. 00001
      b. 10000
      c. 01010
      
4. Give an example of worst-case input for this algorithm
   (text, problem 6, page 106).