哈夫曼编码压缩实验报告

Huffman编码压缩实验报告程序说明：压缩/解压程序；计算压缩比。实验说明：根据字符的权值，运用哈夫曼算法，找出最小的两个替代合为一个新权值，再放入队列，排序。如此循环重复，直至算法结束，即只剩一个根节点。最后，根节点记为0，相对的，子树左节点记为0，右节点记为1，一次输出编码。源代码：#include#include#include#includeusing namespace std;#define N 1000char stN,cntN;int l,n,m,sum,newsum;struct aaa char cc; int val; int dep; int l,r; int index;struct bbb char zi200; int l;bianma200;aaa a2000,b2000;bool cmp(aaa a1, aaa a2) if(a1.val=a2.val) return a1.depa2.dep; else return a1.vala2.val;void preput(int index) coutaindex.cc(aindex.val) ; if(aindex.l!=0) preput(aindex.l); if(aindex.r!=0) preput(aindex.r);void search(char st200,int ll,int index,char ch) int i,j; ll+; stll=ch; if(aindex.l=0) coutThe aindex.cc will be ; if(ll=1)cout0; bianmaint(aindex.cc).zi1=0; bianmaint(aindex.cc).l=1; else bianmaint(aindex.cc).l=0; for(i=2;i=ll;i+) bianmaint(aindex.cc).l+; bianmaint(aindex.cc).zibianmaint(aindex.cc).l=sti; coutsti; coutb) return a; else return b;int main() int i,j; cout*endl; coutPlease input your characters needed to compreSS，end with !endl; cout*endl; coutYour string: ; while(cin.getline(st,sizeof(st) l=strlen(st); n=1; sum=8*l;for(i=0;il;i+) cnti=sti;if(l=1 & st0=!) break; sort(st,st+l);an.cc=st0; an.val=1; an.dep=0; an.l=0; an.r=0; an.index=1;for(i=1;il;i+) if(sti!=an.cc) n+; an.cc=sti; an.val=1; an.dep=0; an.l=0; an.r=0; an.index=n;else an.val+; for(i=1;i=n;i+) bi=ai; coutThe bi.cc weighted bi.valendl;coutendl; i=1;m=n;sort(b+i,b+i+n,cmp);while(im) n+; an.val=bi.val+bi+1.val; an.index=n; an.l=bi.index; an.r=bi+1.index; an.dep=maxx(bi.dep,bi+1.dep)+1; m=n; bm=an; i+=2; sort(b+i,b+1+n,cmp);char st2200; search(st2,0,m,0);coutendl;coutThe final result: ; newsum=0;for(i=0;il;i+) for(j=1;j=bianmaint(cnti).l;j+) coutbianmaint(cnti).zij;newsum+; coutendl;coutcompression ratio(