← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

15 第15章 贪心算法

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

is implemented. Let’s assume that it’s implemented as a binary min-heap (see Chapter 6).

For a set C of n characters, the BUILD-MIN-HEAP procedure discussed in Section 6.3 can initialize Q in line 2 in O(n) time. The for loop in lines 3–10 executes exactly n − 1 times, and since each heap operation runs in O(lg n) time, the loop contributes O(n lg n) to the running time. Thus, the total running time of HUFFMAN on a set of n characters is O(n lg n).

Correctness of Huffman’s algorithm To prove that the greedy algorithm HUFFMAN is correct,

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea