文件名称:3
- 所属分类：
- 软件工程
- 资源属性：
- [Windows] [Visual C] [源码]
- 上传时间：
- 2013-06-05
- 文件大小：
- 253kb
- 下载次数：
- 0次
- 提 供 者：
- mi***
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
对一篇由英文字母、空格、标点符号构成的文档，进行Huffman编码
数据输入：
由文件input.txt给出输入数据。
输入文件示例
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.
输出文件示例
output.txt
各字符对应的哈夫曼编码为：
A：0101001 空格：01 句号：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
原文档的哈夫曼编码输出：0101001011010000111100111011011110011100101011（太长了，后面
就不输了。。。）-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 ..)
数据输入：
由文件input.txt给出输入数据。
输入文件示例
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.
输出文件示例
output.txt
各字符对应的哈夫曼编码为：
A：0101001 空格：01 句号：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
原文档的哈夫曼编码输出：0101001011010000111100111011011110011100101011（太长了，后面
就不输了。。。）-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 ..)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
实验三
......\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