《计算模型与算法技术教学课件》7-Space and Time Tradeoffs.pptVIP

* * * * * * * * * * * * * * Boyer-Moore Algorithm (cont.) Step 1 Fill in the bad-symbol shift table Step 2 Fill in the good-suffix shift table Step 3 Align the pattern against the beginning of the text Step 4 Repeat until a matching substring is found or text ends: Compare the corresponding characters right to left.  If no characters match, retrieve entry t1(c) from the bad-symbol table for the text’s character c causing the mismatch and shift the pattern to the right by t1(c). If 0 k m characters are matched, retrieve entry t1(c) from the bad-symbol table for the text’s character