https://github.com/hxndev/huffman-encoding-using-binary-trees
The idea behind Huffman coding is based upon the frequency of a symbol in a sequence. The symbol that is the most frequent in that sequence gets a new code that is very small, the least frequent symbol will get a code that is very long, so that when we’ll translate the input we want to encode the most frequent symbols will take less space than they used to and the least frequent symbols will take more space but because they’re less frequent it won’t matter that much.
https://github.com/hxndev/huffman-encoding-using-binary-trees
algorithm binary-search-tree binary-tree compression compression-algorithm cpp decryption encoding encryption huffman vecctor visual-studio
Last synced: 7 months ago
JSON representation
The idea behind Huffman coding is based upon the frequency of a symbol in a sequence. The symbol that is the most frequent in that sequence gets a new code that is very small, the least frequent symbol will get a code that is very long, so that when we’ll translate the input we want to encode the most frequent symbols will take less space than they used to and the least frequent symbols will take more space but because they’re less frequent it won’t matter that much.
- Host: GitHub
- URL: https://github.com/hxndev/huffman-encoding-using-binary-trees
- Owner: HxnDev
- License: mit
- Created: 2021-05-20T11:24:44.000Z (over 4 years ago)
- Default Branch: main
- Last Pushed: 2021-07-23T11:59:54.000Z (over 4 years ago)
- Last Synced: 2023-03-04T18:38:10.286Z (over 2 years ago)
- Topics: algorithm, binary-search-tree, binary-tree, compression, compression-algorithm, cpp, decryption, encoding, encryption, huffman, vecctor, visual-studio
- Language: C++
- Homepage:
- Size: 413 KB
- Stars: 4
- Watchers: 1
- Forks: 0
- Open Issues: 0