- Category:
- 2D Graphic
- Tags:
-
[C/C++]
[源码]
- File Size:
- 2.15kb
- Update:
- 2008-10-13
- Downloads:
- 0 Times
- Uploaded by:
Description: huffman_f in huffman_e, on the basis of order to use Heap Sort tenets of the two smallest choose the right values. That is, all the elements of the weights organizations piles, each pile of Root is a minimum. Root out every one after, they pile tail elements transferred Root reconstruction reactor. Two out minimum son into a tree, then the tree-leaf nodes as into rubble, and allowed to rise to a suitable location, to maintain the nature of sculpture. Because each time without complete the entire sequencing process, and the only organization piles, therefore, this method than using the rapid sequencing faster. Reference to the above algorithm mg-1.2.1 Huffman coding to achieve, see http://www.cs.mu.oz.au/mg
To Search:
File list (Check if you may need any files):
Download