Huffman Coding

Compression Algorithm

In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. The process of finding or using such a code proceeds by means of Huffman coding.
This project is about Encode and Decode an input string by using Greedy Algorithm.
The images below show us how the algorithm works

Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.

Name		Name	Last commit message	Last commit date
Latest commit History 12 Commits
Huffman		Huffman
.gitattributes		.gitattributes
.gitignore		.gitignore
1.jpg		1.jpg
2.jpg		2.jpg
3.jpg		3.jpg
Huffman.sln		Huffman.sln
LICENSE		LICENSE
README.md		README.md