What is the following code an implementation of?

Question

public class Program {
public static void main(String[] args) {
String text = "ABAACAADAABAAABAA";
String pattern = "AABA";
System.out.println("match found at position: " + search(text, pattern));
}

static int search(String text, String pattern) {
int R = 256;
int[] right = new int[R];

for (int i = 0; i < R; i++ ) {
right[i] = -1;
}
for (int j = 0; j < pattern.length(); j++ ) {
right[pattern.charAt(j)] = j;
}

int m = pattern.length();
int n = text.length();
int skip;

for (int i = 0; i <= n - m; i += skip) {
skip = 0;
for (int j = m-1; j >= 0; j--) {
if (pattern.charAt(j) != text.charAt(i+j)) {
skip = Math.max(1, j - right[text.charAt(i+j)]);
break;
}
}
if (skip == 0) return i;
}
return n;
}
}
a. Boyer-Moore algorithm
b. Naive search algorithm
c. Rabin-Karp algorithm
d. Knuth-Morris-Pratt algorithm

Answer 1

a. Boyer-Moore algorithm