实验报告11

1.问题．

2.解析

3.设计

void CreateHuffmanTree(HuffmanTree T) {//构造哈夫曼树，T[m-1]为其根结点
int i, p1, p2;
InitHuffmanTree(T);
InputWeight(T);
for (i = n; i < m; i++) {
SelectMin(T, i - 1, &p1, &p2);
T[p1].parent = T[p2].parent = i;
T[i].lchild = p1;
T[i].rchild = p2;
T[i].weight = T[p1].weight + T[p2].weight;
}
}

void CharSetHuffmanEncoding(HuffmanTree T, HuffmanCode H) { //根据哈夫曼树T求哈夫曼编码表H
int c, p;
char cd[n + 1];
int start;
cd[n] = ‘\0’;
getchar();
for (int i = 0; i < n; i++) {
H[i].ch = getchar();
start = n;
c = i;
while ((p = T[c].parent) >= 0) {
if (T[p].lchild == c)
cd[–start] = ‘0’;
else
cd[–start] = ‘1’;
c = p;
}
strcpy(H[i].bits, &cd[start]);
}
}

4.分析

O(nlogn)频率排序：
for 循环 O(n)，
插入操作 O(logn)，
算法时间复杂度是 O(nlogn)