← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

6 第6章 堆排序

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

ERT in a d-ary max-heap. Analyze its running time in terms of d and n. 6-3 Young tableaus

An m × n Young tableau is an m × n matrix such that the entries of each row are in sorted order from left to right and the entries of each column are in sorted order from top to bottom.

Some of the entries of a Young tableau may be ∞, which we treat as nonexistent elements.

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea