Lecture 15: Greedy Algorithms

L15 Slides

We discussed how the Huffman algorithm finds the optimal prefix-free compression code for a given frequency of characters over an alphabet.