原书出处
Introduction to Algorithms, Fourth Edition
32 第32章 字符串匹配
ositions match successfully or a mismatch is found. Line 3 prints out each valid shift s.
Procedure NAIVE-STRING-MATCHER takes O((n – m + 1)m) time, and this bound is tight in the worst case. For example, consider the text string an (a string of na’s) and the pattern am. For each of the n−m+1 possible values of the shift s, the implicit loop on line 2 to compare corresponding characters must execute m times to validate the shift. The worst-case running time is thus Θ((n − m + 1)m), which is Θ(n2) if m = ⌊n/2⌋. Because it
requires no preprocessing, NAIVE-STRING-MATCHER’s running time equals its matching time.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea