← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

3 第3章 运行时间的刻画

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

O(n2). We might also write 2n2 + 3n + 1 = 2n2 + Θ(n). How do we interpret such formulas?

When the asymptotic notation stands alone (that is, not within a larger formula) on the right-hand side of an equation (or inequality), as in 4n2 + 100n + 500 = O(n2), the equal sign means set membership: 4n2 + 100n + 500 ∈ O(n2). In general, however, when asymptotic notation appears in a formula, we interpret it as standing for some anonymous function that we do not care to name.

For example, the formula 2n2 + 3n + 1 = 2n2 + Θ(n) means that 2n2 + 3n + 1 = 2n2 + f (n),

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea