原书出处
Introduction to Algorithms, Fourth Edition
32 第32章 字符串匹配
lgorithm is only O((n−m+1)+cm) = O(n+m), plus the time required to process spurious hits.
We can base a heuristic analysis on the assumption that reducing values modulo q acts like a random mapping from ∑* to ℤq. The expected number of spurious hits is then O(n/q), because we can estimate the chance that an arbitrary ts will be equivalent to p, modulo q, as 1/q. Since there are O(n) positions at which the test of line 8 fails (actually, at most n − m + 1 positions) and checking each hit takes O(m) time in line 9, the expected matching time taken by the
Rabin-Karp algorithm is RABIN-KARP-MATCHER(T, P, n, m, d, q) 1 h = dm−1 mod q 2 p = 0 3 t
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter032.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea