function NaiveSearch(string s[1..n], string pattern[1..m])

   for i from 1 to n-m+1

      for j from 1 to m

         if s[i+j-1] ≠ pattern[j]

            jump to next iteration of outer loop

      return i

   return not found