Write in C

$//$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

BruteForceStringMatch$($T $[0..$n $1],$ P$[0..$m $1])$

for i $0$ to n $$ m do

j $0$

while j