The brute force algorithm for string matching is given below: ALGORITHM Brute Force String Match(T[0..n-1], P[0..m-1])...

   

Transcribed Image Text:

The brute force algorithm for string matching is given below: ALGORITHM Brute Force String Match(T[0..n-1], P[0..m-1]) //Implements brute-force string matching //Input: An array T[0..n-1] of n characters representing a text and an array P[0..m- 1] of m characters representing a pattern //Output: The index of the first character in the text that starts a matching substring or -1 if the search is unsuccessful 11 for i 0 ton - m do j <0 while j The brute force algorithm for string matching is given below: ALGORITHM Brute Force String Match(T[0..n-1], P[0..m-1]) //Implements brute-force string matching //Input: An array T[0..n-1] of n characters representing a text and an array P[0..m- 1] of m characters representing a pattern //Output: The index of the first character in the text that starts a matching substring or -1 if the search is unsuccessful 11 for i 0 ton - m do j <0 while j