The Boyer-Moore algorithm is typically used with one or both the bad character and good suffix rule. When used with both rules, the shift that is to occur is the biggest one produced by the rules. The Boyer-Moore algorithm improves the naive search algorithm in the average case, but is still O(nm) in the worst case (that case being the same described in the previous section, that is, a repeated group of characters both in the pattern and in the text).