This was an assignment for my algorithms class. This Project takes in a text file, reads the text, and creates a Huffman tree based on the frequency of each character. This tree then can be used to encode/compress the text with a 60% reduction for larger files. There is also summary and detailed reports generated for each text file.
walkerreynolds16/Huffman-Encoding-Project
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
This was an assignment for my algorithms class. This Project takes in a text file, reads the text, and creates a Huffman tree based on the frequency of each character. This tree then can be used to encode/compress the text with a 60% reduction for larger files. There is also summary and detailed reports generated for each text file.
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published