原书出处
Introduction to Algorithms, Fourth Edition
4 第4章 分治策略
thod for solving algorithmic recurrences of the form where a > 0 and b > 1 are constants.
We call f (n) a driving function, and we call a recurrence of this general form a master recurrence.
To use the master method, you need to memorize three cases, but then you’ll be able to so
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter004.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea