Let          Pattern P = CAT
               Text = ABABNACATMAN
Then there is a match with the shift 7 in the text T

Brute Force String Matching algorithm.

• This algorithm is a simple and obvious one, in which we compare a given pattern P with each of the sub strings of the text T, moving from left to right, until a match is found
• Let S_i is the substring of T, beginning at the i th position and whose length is same as pattern P.
• We compare P, character by character, with the first substring S₁. If all the corresponding characters are same, then the pattern P appears in T at shift 1. If some of the characters of S₁ are not matched with he corresponding characters of P, then we try for the next substring S₂. This procedure continues till the input text exhausts.
• In this algorithm we have to compare P with n-m+1 substrings of T.