Consider the following string matching algorithm, what is the name of this algorithm?

Question

void algo(String P, String T) {

int N = T.length()-1;
int M = P.length()-1;

char p = P.charAt(M);

for(int x=N;x>=0;x--){
if(T.charAt(x) == p){
int y=0;
for(y=0;y<=M;y++){
if(T.charAt(x-M+y) != P.charAt(y))
break;
}

if(y ==M+1)
System.out.printf("Match at:%d%n",(x-M));
}
}
}

a. Naïve string matching
b. Boyer-Moore
c. Rabin-Karp
d. Aho-Corasick

Answer 1

a. Naïve string matching
This is the naive string match algorithm, but in reverse, that is, from the end of the string. When a match at the last character of the pattern P is found at the tail of the string text T, a match is reported. To compare the pattern P to the string text T at the position, the comparison is offset to compare from the start of the pattern P.