← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

6 第6章 堆排序

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

ry node on a simple path from the root down to a leaf.) 6.3 Building a heap The procedure

BUILD-MAX-HEAP converts an array A[1 : n] into a max-heap by calling MAX-HEAPIFY in a bottom-up manner.

Exercise 6.1-8 says that the elements in the subarray A[⌊n/2⌋ + 1 : n] are all leaves of

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea