Brute-Force Pattern Matching

bruteforcematch.c

int  bruteforcematch(char S[ ], char P[ ]) //  S is source string, P is pattern
{
  int n, m, i, j; 
  n  = strlen(S);
  m = strlen(P);
  
  for  (i = 0;  i <= n – m; i++) //  for each pattern comparison
  {
    j = 0;
    while(j < m && S[i+j] == P[j]) //  each character comparison
    { j++; }	//  end while
    
    if  (j == m) 
    { return  i; }
    else
    { return  -1; } //  not matched
  }  //  end for
}

Brute-Force Pattern Matching
only suitable for small strings with very few repeated sequences.