2023年哈弗曼編碼實(shí)驗(yàn)報(bào)告無損壓縮實(shí)驗(yàn)報(bào)告

哈弗曼編碼實(shí)現(xiàn)無損壓縮試驗(yàn)匯報(bào)試驗(yàn)內(nèi)容通過C++編程實(shí)現(xiàn)。規(guī)定：1)字符串旳輸入是手工輸入旳；2)通過程序?qū)崿F(xiàn)編碼，最終在屏幕上顯示編碼成果，例如，假如選用huffman編碼，則要顯示字符串旳編碼以及平均碼長；源代碼#include<iostream.h>#include<math.h>#include<string.h>#include<stdlib.h>#if!defined_HUFFMANTREE_H_#define_HUFFMANTREE_H_classHuffmanTree{public:unsignedintWeight;unsignedintParent;unsignedintlChild;unsignedintrChild;};typedefchar**HuffmanCode;/*從結(jié)點(diǎn)集合中選出權(quán)值最小旳兩個(gè)結(jié)點(diǎn)將值分別賦給s1和s2*/voidSelect(HuffmanTree*HT,intCount,int*s1,int*s2){unsignedinttemp1=0;unsignedinttemp2=0;unsignedinttemp3;for(inti=1;i<=Count;i++){if(HT[i].Parent==0){if(temp1==0){temp1=HT[i].Weight;(*s1)=i;}else{if(temp2==0){temp2=HT[i].Weight;(*s2)=i;if(temp2<temp1){temp3=temp2;temp2=temp1;temp1=temp3;temp3=(*s2);(*s2)=(*s1);(*s1)=temp3;}}else{if(HT[i].Weight<temp1){temp2=temp1;temp1=HT[i].Weight;(*s2)=(*s1);(*s1)=i;}if(HT[i].Weight>temp1&&HT[i].Weight<temp2){temp2=HT[i].Weight;(*s2)=i;}}}}}}/*霍夫曼編碼函數(shù)*/voidHuffmanCoding(HuffmanTree*HT,HuffmanCode*HC,int*Weight,intCount){inti;ints1,s2;intTotalLength;char*cd;unsignedintc;unsignedintf;intstart;if(Count<=1)return;TotalLength=Count*2-1;HT=newHuffmanTree[(TotalLength+1)*sizeof(HuffmanTree)];for(i=1;i<=Count;i++){HT[i].Parent=0;HT[i].rChild=0;HT[i].lChild=0;HT[i].Weight=(*Weight);Weight++;}for(i=Count+1;i<=TotalLength;i++){HT[i].Weight=0;HT[i].Parent=0;HT[i].lChild=0;HT[i].rChild=0;}//建造霍夫曼樹for(i=Count+1;i<=TotalLength;++i){Select(HT,i-1,&s1,&s2);HT[s1].Parent=i;HT[s2].Parent=i;HT[i].lChild=s1;HT[i].rChild=s2;HT[i].Weight=HT[s1].Weight+HT[s2].Weight;}//輸出霍夫曼編碼(*HC)=(HuffmanCode)malloc((Count+1)*sizeof(char*));cd=newchar[Count*sizeof(char)];cd[Count-1]='\0';for(i=1;i<=Count;++i){start=Count-1;for(c=i,f=HT[i].Parent;f!=0;c=f,f=HT[f].Parent){if(HT[f].lChild==c)cd[--start]='0';elsecd[--start]='1';(*HC)[i]=newchar[(Count-start)*sizeof(char)];strcpy((*HC)[i],&cd[start]);}}delete[]HT;delete[]cd;}/**在字符串中查找某個(gè)字符*假如找到，則返回其位置*/intLookFor(char*str,charletter,intcount){inti;for(i=0;i<count;i++){if(str[i]==letter)returni;}return-1;}voidOutputWeight(char*Data,intLength,char**WhatLetter,int**Weight,int*Count){inti;char*Letter=newchar[Length];int*LetterCount=newint[Length];intAllCount=0;intIndex;intSum=0;floatPersent=0;for(i=0;i<Length;i++){if(i==0){Letter[0]=Data[i];LetterCount[0]=1;AllCount++;}else{Index=LookFor(Letter,Data[i],AllCount);if(Index==-1){Letter[AllCount]=Data[i];LetterCount[AllCount]=1;AllCount++;}else{LetterCount[Index]++;}}}for(i=0;i<AllCount;i++){Sum=Sum+LetterCount[i];}(*Weight)=newint[AllCount];(*WhatLetter)=newchar[AllCount];for(i=0;i<AllCount;i++){Persent=(float)LetterCount[i]/(float)Sum;(*Weight)[i]=(int)(1000*Persent);(*WhatLetter)[i]=Letter[i];}(*Count)=AllCount;delete[]Letter;delete[]LetterCount;}#endif//*********************************main.cppvoidmain(){HuffmanTree*HT=NULL;HuffmanCodeHC;charData[100];char*WhatLetter;int*Weight;intCount;cout<<"請輸入一行文本數(shù)據(jù):"<<endl;cin>>Data;cout<<endl;OutputWeight(Data,strlen(Data),&WhatLetter,&Weight,&Count);HuffmanCoding(HT,&HC,Weight,Count);cout<<"字符出現(xiàn)頻率編碼成果"<