← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

6 第6章 堆排序

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

0 ≤ h ≤ ⌊lg n⌋. Since ⌈x⌉ ≤ 2x for any x ≥ 1/2, we have ⌈n/2h + 1⌉ ≤ n/2h. We thus obtain

Hence, we can build a max-heap from an unordered array in linear time.

To build a min-heap, use the procedure BUILD-MIN-HEAP, which is the same as BUILD-MAX-HEA

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea