原书出处
Introduction to Algorithms, Fourth Edition
4 第4章 分治策略
method. The master method (Sections 4.5 and 4.6) is the easiest method, when it applies.
It provides bounds for recurrences of the form T (n) = aT (n/b) + f (n), where a > 0 and b > 1 are constants and f (n) is a given “driving” function.
This type of recurrence tends to arise more frequently in the study of algorithms than an
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter004.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea