each time the method makes shiftit is guaranteed not to "skipover any possible matches for last(cis the location of the last occurrence of in the worst-case running time of the bm algorithm is (nm+| |namelythe computation of the last function takes time ( +| |and the actual search for the pattern takes (nmtime in the worst casethe same as the brute-force algorithm an example of text-pattern pair that achieves the worst case is the worst-case performancehoweveris unlikely to be achieved for english textforin this casethe bm algorithm is often able to skip large portions of text (see figure experimental evidence on english text shows that the average number of comparisons done per character is for five-character pattern string figure an example of boyer-moore execution on english text