BF algorithm (brute force matching algorithm)

Compares the main string m specified position and the target string s start position, if the same compares the next character of M with the next character of S, if different then the next character of M and the start position of S is compared until each character in S is equal to the contiguous string in m, otherwise it does not match.

C # code--

       Private Static intIndex (stringMintPosstrings) {intM_len =m.length; intS_len =s.length; inti = pos-1; intj =0; if(pos>M_len) {                return-1; }             while(I<m_len && j<S_len) {                if(m[i]==S[j]) {i++; J++; }                Else{J=0; I= I-j +1; }            }            if(j>=S_len) {                returnIS_len; }            Else            {                return 0; }        }//called intres = Index ("ASDFGHJKL",2,"FGHJK"); Console.WriteLine (res);

Complexity of O (m*n)

BF algorithm (brute force matching algorithm)