Lecture 15: Greedy Algorithms
We discussed how the Huffman algorithm finds the optimal prefix-free compression code for a given frequency of characters over an alphabet.
To view this video please enable JavaScript, and consider upgrading to a web browser that supports HTML5 video