原书出处
Introduction to Algorithms, Fourth Edition
4 第4章 分治策略
.18) by summing the costs of the nodes at each depth in the tree, as shown in the figure.
The first term in the equation is the total costs of the leaves.
Since each leaf is at depth ⌊logbn⌋ + 1 and , the base case of the recurrence gives the c
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter004.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea