A program utilizing lossless compression and the Huffman Algorithm.
Explore the docs »
View Demo
·
Report Bug
·
Request Feature
A project made to learn and implement the Huffman Algorithm and lossless compression.
Allowed for greater understanding of binary trees and their traversal via recursion.
- Understanding of binary tree traversals
- Post-Order
- Pre-Order
- Usage of the huffman algorithm
- Compression and decompression of bits through lossless compression
To get a local copy up and running follow these simple steps.
- Clone the repo
git clone https://github.com/karanvirheer/File-Compressor.git
To compress your files up to 53% of their original size. Allows for files to be decompressed back to original size.
Contributions are what make the open source community such an amazing place to be learn, inspire, and create. Any contributions you make are greatly appreciated.
- Fork the Project
- Create your Feature Branch (
git checkout -b feature/AmazingFeature
) - Commit your Changes (
git commit -m 'Add some AmazingFeature'
) - Push to the Branch (
git push origin feature/AmazingFeature
) - Open a Pull Request
Karanvir Heer - @Karanvir_H - karanvir.heer@ryerson.ca
Project Link: https://github.com/karanvirheer/File-Compressor