原书出处
Introduction to Algorithms, Fourth Edition
26 第26章 并行算法
tant amount of extra work, we obtain the recurrence T (n) = T (n − 1) + T (n − 2) + Θ(1).
This recurrence has solution T (n) = Θ(Fn), which we can establish by using the substitution method (see Section 4.3). To show that T (n) = O(Fn), we’ll adopt the inductive hypothesis that T (n) ≤ aFn −
b, where a > 1 and b > 0 are constants. Substituting, we obtain T (n) ≤ (aFn−1 − b) + (aF
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea