← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

8 第8章 线性时间排序

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

parison sort algorithm. The following theorem establishes such a lower bound. Theorem 8.1

Any comparison sort algorithm requires Ω(n lg n) comparisons in the worst case.

Proof From the preceding discussion, it suffices to determine the height of a decision tr

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea