Description: On the one by the English letters, spaces, punctuation marks consisting of documents, Huffman coding data input: the file input.txt given input data. Sample input file input.txt A priority queue is a queue where each element has a priority and the element with the highest priority is at the front of the queue and will be the first element to be removed. Example output file output.txt each character corresponding Huffman is: A: 0101001 space: 01 period: 0101000 a: 11010 b: 011001 c: 0101100 d: 010101 e: 111 f: 010111 g: 0101101 h: 1000 i: 1001 l: 01000 m: 01101 n: 10110 o: 11011 p: 101000 q: 101001 r: 0111 s: 01001 t: 1100 u: 10111 v: 011000 w: 101010 y: 101011 original document Huffman coding output: 0101001011010000111100111011011110011100101011 (too long, back on the do not lose ..)
To Search:
File list (Check if you may need any files):
实验三
......\Debug
......\.....\huffman.obj
......\.....\main.obj
......\.....\vc60.idb
......\.....\vc60.pdb
......\.....\实验三.exe
......\.....\实验三.ilk
......\.....\实验三.pch
......\.....\实验三.pdb
......\huffman.cpp
......\huffman.h
......\input.txt
......\main.cpp
......\output.txt
......\实验三.dsp
......\实验三.dsw
......\实验三.ncb
......\实验三.opt
......\实验三.plg
Download