huffman编码c实现.doc

#includestdio.h#includestdlib.h#includestring.h#includemalloc.h#define N 20#define M 2*N-1#define Min 1000 /*最小值*/typedef structchar ch; /*权值对应的字符*/int weight; /*权值*/int parent; /*双亲位置*/int Lchild; /*左孩子位置*/int Rchild; /*右孩子位置*/HTNode,HuffmantreeM+1;char hcN+1N+1;void OutputHuffmancode(Huffmantree ht, int n);void CrtHuffmancode(Huffmantree ht, int n);void OutputHuffmantree(Huffmantree ht,int n);void select(Huffmantree ht,int a,int *s1,int *s2)int i;int c1=Min;int c2;for(i=1;i=a;i+) if (ht.parent=0&ht.weightc1) *s1=i; c1=ht.weight; c2=Min;for(i=1;i=a;i+) if (ht.parent=0&(*s1!=i)&c2ht.weight) *s2=i; c2=ht.weight; void CrtHuffmantree(Huffmantree ht,int w,char elem,int n)int i;int m;int s1,s2;m=2*n-1;ht=(HTNode *)malloc(m)*sizeof(HTNode);for(i=1;i=n;i+) ht.ch=elemi-1; ht.weight=wi-1; ht.parent=0; ht.Lchild=0; ht.Rchild=0; for(i=n+1;i=m;i+) ht.ch=0; ht.weight=0; ht.parent=0; ht.Lchild=0; ht.Rchild=0; /*初始化完毕*/for(i=n+1;i=m;i+) select( ht,i-1,&s1,&s2); /*返回最小值和次小值的位置*/ ht.weight=hts1.weight+hts2.weight; hts1.parent=i; hts2.parent=i; ht.Lchild=s1; ht.Rchild=s2;/*建立树完毕*/ OutputHuffmantree( ht,m); printf(now begin crthuffman coden); CrtHuffmancode( ht, n); printf(crthuffman code endn); OutputHuffmancode(ht, n);void OutputHuffmantree(Huffmantree ht,int n) int i; printf(nnumber-weight-parent-Lchild-Rchild-huffman charn n); for(i=1;i=n;i+) printf(%dt%dt%dt%dt%dt%cn,i,ht.weight,ht.parent,ht.Lchild,ht.Rchild,ht.ch);void CrtHuffmancode(Huffmantree ht, int n) /*建立编码*/ int i,c,p; int start; char *cd; cd=(char *) malloc(n+1)*sizeof(char); memset(cd,0,sizeof(cd); for(i=1;i=n;i+) start=n; cdstart=0; c=i; p=ht.parent; while(p!=0) start-; if(htp.Lchild=c) cdstart=0; else cdstart=1; c=p; p=htp.parent; /cdstart = 0; printf(cd is %sn start is %dn, cd+start, start); sprintf(hc, %s, cd+start); /*将已存在的编码复制到code中*/ free(cd);void OutputHuffmancode(Huffmantree ht,int n) int i; printf(nweight_char-weight-huffmancoden n);for(i=1;i=n;i+) printf( %ct%4dt%sn,ht.ch,ht.weight,hc); int main()int n = 6;/*记录了权值个数*/