文件名称:hafumshu
-
所属分类:
- 标签属性:
- 上传时间:2017-07-07
-
文件大小:1kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
总结
1.基本上没有什么太大的问题,在调用select()这个函数时,想把权值最小的两个结点的序号带回HuffmanCoding(),所以把那2个序号设置成了引用。
2.在编程过程中,在什么时候分配内存,什么时候初始化花的时间比较长
3.最后基本上实现后,发现结果仍然存在问题,经过分步调试,发现了特别低级的输入错误。把HT[i].weight=HT[s1].weight+HT[s2].weight;中的s2写成了i(summary
1. basically there is no big problem, in the call select () this function, want to minimize the weight of the two nodes of the ordinal number back to HuffmanCoding (), so the 2 serial number set as a reference.
2. in the programming process, when to allocate memory, when initialization, the longer the time spent
3., after the last basically implemented, found that the results are still problems, after step-by-step debugging, found a particularly low-level input errors. Write I in HT[i].weight=HT[s1].weight+HT[s2].weight; S2 in)
1.基本上没有什么太大的问题,在调用select()这个函数时,想把权值最小的两个结点的序号带回HuffmanCoding(),所以把那2个序号设置成了引用。
2.在编程过程中,在什么时候分配内存,什么时候初始化花的时间比较长
3.最后基本上实现后,发现结果仍然存在问题,经过分步调试,发现了特别低级的输入错误。把HT[i].weight=HT[s1].weight+HT[s2].weight;中的s2写成了i(summary
1. basically there is no big problem, in the call select () this function, want to minimize the weight of the two nodes of the ordinal number back to HuffmanCoding (), so the 2 serial number set as a reference.
2. in the programming process, when to allocate memory, when initialization, the longer the time spent
3., after the last basically implemented, found that the results are still problems, after step-by-step debugging, found a particularly low-level input errors. Write I in HT[i].weight=HT[s1].weight+HT[s2].weight; S2 in)
相关搜索: hafum
(系统自动生成,下载前可以参看下载内容)
下载文件列表
hafuman.txt
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.