Algorithms

🗜️ Compression Visualizer

Step through Huffman coding and Run-Length Encoding to see how text compression actually works. Watch trees build, codes assign, and bits encode in real time.


Step 1 / 21

Phase:

frequency

Count 'A'

Character 'A' appears 5 times in the input.

Huffman Tree

Tree will appear during tree-building phase

Statistics

Original

11 chars (88 bits)

Compressed

--

Ratio

--

Unique chars

1


Frequencies

A

5


© 2026 Adam Hultman