This video is part of Professor Frank Stajano’s lecture course on Algorithms at the University of Cambridge.
Within certain assumptions, Huffman coding is the best possible way to compress a string of symbols. This optimal code can be built efficiently using a greedy algorithm, which we explain in this video.
If you find my lectures useful, give the videos a thumbs up. Subscribe and hit the notification bell for more of the same and to encourage me to publish more videos for budding computer scientists. Leave your comments below.
Course web page:
https://www.cl.cam.ac.uk/teaching/current/Algorithms/
Course handout:
https://www.cl.cam.ac.uk/teaching/2021/Algorithms/2020-2021-stajano-algs-handout.pdf
My home page:
https://www.cl.cam.ac.uk/~fms27/
Add comment