This code is a Huffman implementation in C++ and Haskell, which uses Binary Tree to count characters frequency (frequency map), to get a shortes code. This kind of algorithm is used in file compress process.
-
Notifications
You must be signed in to change notification settings - Fork 0
FefeProgrammer2001/Huffman
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published