Boyer-Moore

int i = 0;
while (true) {
  int j = m.length ();
  while (true) {
    if (m[j] != w[i+j]) break;
    if (j == 1) return i;
    j--;
  }
  i += offset;
}

offset ist Maximum von:

• bad-character heuristics
• good-suffix heuristics