← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

6 第6章 堆排序

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

MAX-HEAP′ requires Θ(n lg n) time to build an n-element heap. 6-2 Analysis of d-ary heaps

A d-ary heap is like a binary heap, but (with one possible exception) nonleaf nodes have d children instead of two children.

In all parts of this problem, assume that the time to maintain the mapping between object

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea