java

ALGORITHM BruteForceStringMatch(T [0.n1],P[0..m1]) /Implements brute-force string matching //Input: An array T[0..n1] of n characters representing a text and II an array P[0.m1] of m characters representing a pattern //Output: The index of the first character in the text that starts a II matching substring or 1 if the search is unsuccessful for i0 to nm do j0 while j