原书出处
Introduction to Algorithms, Fourth Edition
4 第4章 分治策略
oments to understand broadly what it says. The function is called the watershed function.
In each of the three cases, we compare the driving function f (n) to the watershed function .
Intuitively, if the watershed function grows asymptotically faster than the driving funct
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter004.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea