Skip to content

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

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 
 
 
 
 
 
 

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

No packages published

Languages