← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

4 第4章 分治策略

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

ollowing two properties hold: 1. For all n < n0, we have T (n) = Θ(1). 2. For all n ≥ n0,

every path of recursion terminates in a defined base case within a finite number of recursive invocations.

Similar to how we sometimes abuse asymptotic notation (see page 60), when a function is n

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea