← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

2 第2章 算法入门

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

e more efficient than another if its worst-case running time has a lower order of growth.

Due to constant factors and lower-order terms, an algorithm whose running time has a higher order of growth might take less time for small inputs than an algorithm whose running time has a lower order of growth.

But on large enough inputs, an algorithm whose worst-case running time is Θ(n2), for exam

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea