Description: Huffman algorithm rewrite the classic blend of quick sort, insertion sort, the compression stage: each assic from root recursive write a DWORD When filled DWORD 32-bit write-once memory compression fast> and cycle decompression process: each read a DWORD length data again repercussions circulation & filtration that from the left or right subtree restore time when the leaf node is reached, the assic coding and then read the corresponding node pressurization and decompression will appear at the end of time does not meet four bytes of data, I referred to as the complement of the final file size for efficacy.
To Search:
File list (Check if you may need any files):
Huffman.cpp
Huffman.h
Download