这个同学很神# Programming - 葵花宝典
p*o
1 楼
刚在WIKI上看的:(关于用二叉树做PREFIX CODE的故事)
History
In 1951, David Huffman and his MIT information theory classmates were given
the choice of a term paper or a final exam. The professor, Robert M. Fano,
assigned a term paper on the problem of finding the most efficient binary code
. Huffman, unable to prove any codes were the most efficient, was about to
give up and start studying for the final when he hit upon the idea of using a
frequency-sorted binary tree, and quickly proved this method the most
effic
History
In 1951, David Huffman and his MIT information theory classmates were given
the choice of a term paper or a final exam. The professor, Robert M. Fano,
assigned a term paper on the problem of finding the most efficient binary code
. Huffman, unable to prove any codes were the most efficient, was about to
give up and start studying for the final when he hit upon the idea of using a
frequency-sorted binary tree, and quickly proved this method the most
effic
