Sep 13
How Computers Compress Text: Huffman Coding and Huffman Trees
Posted in: UncategorizedComputers store text (or, at least, English text) as eight bits per character. There are plenty of more efficient ways that could work: so why don’t we use them? And how can we fit more text into less space? Let’s talk about Huffman coding, Huffman trees, and Will Smith…(Read…)
Post a Comment