原书出处
Introduction to Algorithms, Fourth Edition
15 第15章 贪心算法
0,000 bits. With the variable-length code shown, the encoding requires only 224,000 bits.
A variable-length code can do considerably better than a fixed-length code. The idea is simple: give frequent characters short codewords and infrequent characters long codewords.
Figure 15.4 shows such a code. Here, the 1-bit string 0 represents a, and the 4-bit strin
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea