GitHub - Cosmin2000B/Huffman-encoding: Huffman code is a data compression algorithm which uses the greedy technique for its implementation. The algorithm is based on the frequency of the characters appearing in a file.

Cosmin2000B / Huffman-encoding Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Huffman code is a data compression algorithm which uses the greedy technique for its implementation. The algorithm is based on the frequency of the characters appearing in a file.

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 6 Commits
BinaryTree.cpp		BinaryTree.cpp
BinaryTree.h		BinaryTree.h
CalcFreq.h		CalcFreq.h
CalcFrq.cpp		CalcFrq.cpp
Reader.cpp		Reader.cpp
Reader.h		Reader.h
input.txt		input.txt
main.cpp		main.cpp
output_1.txt		output_1.txt
output_2.txt		output_2.txt
output_3.txt		output_3.txt

About

Huffman code is a data compression algorithm which uses the greedy technique for its implementation. The algorithm is based on the frequency of the characters appearing in a file.

cryptography binary-tree huffman-encoder huffman-decoder