原书出处
Introduction to Algorithms, Fourth Edition
2 第2章 算法入门
e level after that has total cost c2(n/4) + c2(n/4) + c2(n/4) + c2(n/4) = c2n, and so on.
Each level has twice as many nodes as the level above, but each node contributes only half the cost of a node from the level above.
From one level to the next, doubling and halving cancel each other out, so that the cost
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea