原书出处
Introduction to Algorithms, Fourth Edition
4 第4章 分治策略
quation (A.7), the sum of these coefficients is bounded from above by the constant 16/13.
Since the root’s contribution to the total cost is cn2, the cost of the root dominates the total cost of the tree.
In fact, if O(n2) is indeed an upper bound for the recurrence (as we’ll verify in a momen
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter004.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea