Huffman coding โ the algorithm that makes common letters cheaper to store
Compression is not magic. Huffman coding counts which symbols appear most, builds a tree by repeatedly merging the two least common groups, then gives short bit paths to common letters and longer paths to rare ones.
The result: fewer bits, same message, no data lost.
#huffmancoding#compression#algorithm