哈夫曼编码_贪默算法(国外英文资料).docVIP

哈夫曼编码_贪心算法(国外英文资料) School of computer engineering, Huaihai Institute of Techology Experiment report Course Name: algorithm analysis and design Title: Experiment 3 greedy algorithm Huffman encoding Class: software class 102 Student ID:Name: Deer Xun Comment： Results: instructor: Marking time: Date Algorithm analysis and design experiment report - 4 - Experiment 3 greedy algorithm Experiment purpose and requirement (1) understand the concept of prefix encoding, and understand the basic methods of data compression; (2) the method of proving the optimal substructure property; (3) grasp the design idea of greedy method and be able to use it skillfully (4) the Huffman tree is proved to satisfy the optimal substructure property; (5) design greedy algorithm to solve Huffman coding scheme; (6) design test data and write program documentation. Experiment content Set the character set that needs to be coded to be {d1, d2,... Dn}, they appear at a frequency of {w1, w2,... Wn}, the Huffman tree is used to construct the shortest unequal length coding scheme. Experimental environment Turbo, C, or VC++ Experimental hours 2 hours, we must do experiments Data structures and algorithms Struct Huffman { Double weight; / / used to store each node weights Int lchild, rchild, parent; / / pointer to the parent node and child }; Core source code #includeiostream #include string Using namespace std; Struct Huffman { Double weight; Int, lchild, rchild, parent; }; Static, int, i1=0, i2=0; Int Select (Huffman, huff[], int, I) { Int min=11000; Int min1; For (int k=0; ki; k++) { If (huff[k].weightminhuff[k].parent==-1) { Min=huff[k].weight; Min1=k; } } Huff[min1].parent=1; Return min1; } Void HuffmanTree (Huffman, huff[], int, weight[], int, n) { For (int i=0; i2*n-1; i++) { Huff[i].lchild=-1; Huff[i].parent=-1; Huff[i].rchild=-1; } For (int l=0; ln; l++) { Huff[l].weight=weight[l]; } For (int k=n; k2*n-1; k++) { Int i1=Select (huff, K); Int i2=Select (huff, K); Huff[i1].parent=k; Huff