原书出处
Introduction to Algorithms, Fourth Edition
4 第4章 分治策略
tree, as we did in our analysis of the merge-sort recurrence in Section 2.3.2, can help.
In a recursion tree, each node represents the cost of a single subproblem somewhere in the set of recursive function invocations.
You typically sum the costs within each level of the tree to obtain the per-level costs,
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter004.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea