Build Huffman Compression in Ruby
Posted in ruby, algorithms on January 8th, 2008 5 Comments »
Many wonderful things can be done with binary trees. One brilliant usage of the binary tree was proposed by David Huffman in 1951 at MIT which has since become the foundation for much of the compression technology available today. Huffman discovered a simple way to generate a provable minimal binary encoding given a set of […]