算法设计与分析实验报告贪心算法

1、算法设计与分析实验报告贪心算法班级：2013156 学号：201315614 姓名：张 春 阳哈夫曼编码代码#includefloat smalll,small2;int flagl,flag2,count;typedef struct HuffmanTree(float weight;int Ichild.rchild,parent;huffman；huffman huffmantree100;void CreatHuffmanTree(int njnt m)(int i;void select()；printf(请输AHd个节点的权值二n)；for(i=0;in;i+)scanf(,&hu

2、ffmantreei.weight);printfCXn);for(i=0;im：i+)(huffmantreei.lchild = -1;huffmantreei.rchild = -l;huffmantreei.parent=-l:for(count=n;countm；count+)(selectO:huffmantreeflagl.parent=count;huffmantreeflag2.parent=count;huffmantreecount.weight=smalll+small2;huffmantreecount.lchild=flagl；huffmantreecount.rc

3、hild=flag2;void seiectQint i,a,b:float stemp；int ftemp;a=0;b=0;for(i=0;ismall2)(stemp 二 smalll;smalll=small2;small2=stemp;ftemp=flagl；flagl=flag2;flag2=ftemp；for(i=0;icount;i+)if(huffmantreei.parent=-1)if(flagl!=i)&(flag2!=i)if(huffmantreei.weightsmall2)stemp=smalll;smalll=small2; small2=stemp； ftem

4、p=flagl;flagl=flag2;flag2=ftemp；void huffmancode(int n)(int a 100;int j,k,i,c;for(i=0;i = -l)(k=huffmantreej.parent;if(huffrnantreek.lchild=j)ac=0;if(huffmantreek.rchild = =j) ac=l;c=c+l;j=k；printf(节点%d的哈夫曼编码为：”,i);for(c=c-l;c-l;c-) printf(d,ac);printf(n);void main()(int n,m；Pintf(”请输入一共有几个节点 scanf(”d”,&n);m=2*n-l;CreatHuffmanTree(n,m); huffmancode(n); 截图请输入_共有几个节点:7请输入7个节点的权值：13 8 4 6 9 2节点0的哈夫是编码为：0010节点1的哈夫曼编码为：000节点2的哈夫曼编码为；01节点3的哈夫曼编码为：1