/Text-Compression-Utility

ASCII files can be compressed to smaller sizes by using variable length Huffman Coding. By analyzing the different probabilities of the various symbols that occur in a given file, we can build a Huffman tree to come up with a minimal, optimized binary list of code words for these symbols.

Primary LanguageC++GNU General Public License v3.0GPL-3.0

No issues in this repository yet.