← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

4 第4章 分治策略

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.672Z

rithmically faster than the watershed function, but it does not grow polynomially faster.

If the driving function falls into one of these gaps, or if the regularity condition in case 3 fails to hold, you’ll need to use something other than the master method to solve the recurrence.

As an example of a driving function falling into a gap, consider the recurrence T (n) = 2

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter004.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea