What is the following code an implementation of?

Question

public class Program {
public static void main(String[] args) {
String text = "AABAACAADAABAAABAA";
String pattern = "AABA";
search(text, pattern);
}

private static void search(String text, String pattern) {
int M = pattern.length();
int N = text.length();

for (int i = 0; i <= N - M; i++) {
int j;

for (j = 0; j < M; j++) {
if (text.charAt(i + j) != pattern.charAt(j)) {
break;
}
}

if (j == M) {
System.out.println("Pattern found at index " + j);
}
}
}
}
a. Naive search algorithm
b. Boyer-Moore algorithm
c. Knuth-Morris-Pratt algorithm
d. Rabin-Karp algorithm

Answer 1

a. Naive search algorithm