Unit SS, Part B: String Matching, Naive Algorithm

• O(mn) since can try entire pattern at each position in text string
• Definitions
  • i = index over text where a match might start
  • j = index over pattern (1<=j<=m)
  • k= index over text as try to match