原书出处
Introduction to Algorithms, Fourth Edition
4 第4章 分治策略
at for n ≥ 2n0, the quantity cn dominates the anonymous function hidden by the Θ(n) term.
We’ve shown that the inductive hypothesis holds for the inductive case, but we also need to prove that the inductive hypothesis holds for the base cases of the induction
, that is, that T (n) ≤ cn lg n when n0 ≤ n < 2n0. As long as n0 > 1 (a new constraint on
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter004.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea