原书出处
Introduction to Algorithms, Fourth Edition
32 第32章 字符串匹配
chapter will show that the Knuth-Morris-Pratt algorithm is much better in the worst case.
The naive string-matcher is inefficient because it entirely ignores information gained about the text for one value of s when it considers other values of s. Such information can be quite valuable, however. For example, if P = aaab and s = 0 is valid, then none of the shifts 1, 2, or 3 are valid, since T[4] = b. The following sections examine several ways to make effective use of this sort of
information. Figure 32.3 The operation of the NAIVE-STRING-MATCHER procedure for the patt
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea