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 patternHash = pattern.hashCode();

int M = pattern.length();
int N = text.length();

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

String part = text.substring(i, i + M);

if (part.hashCode() == patternHash && part.equals(pattern)) {
System.out.println("Pattern found at index " + i);
}
}
}
}
a. Rabin-Karp algorithm
b. Naive search algorithm
c. Boyer-Moore algorithm
d. Knuth-Morris-Pratt algorithm

Answer 1

a. Rabin-Karp algorithm