赫夫曼算法效率的优化  

The Optimization of Huffman

作　　者：孙尧[1] 徐欣[1] 陈知千[1] 

机构地区：[1]东华大学计算机科学与技术学院,上海201620

出　　处：《软件导刊》2010年第7期60-62,共3页Software Guide

摘　　要：针对传统的赫夫曼算法中遍历方法循环次数较多、时间复杂度较大等问题,通过对修改数据结构和运算等级改进原有算法,运用排序、优先队列和贪心算法等方法,减少了循环次数,降低了算法时间复杂度;探讨了动态编码算法的优点和可行性。This article discussed the Huffman encoding and the improvement of its efficiency. Problems existed in the original Huffman encoding Algorithm like high cicle index, high time complexity etc. in the traversal method were discussed and improvement suggestions were put forward accordingly. These suggestions which lead to lower cicle index and time complexity are achieved by the modifying original Algorithm＇s data structure and operation level. Also, the article addressed the advantages and feasibility of the dynamic encoding algorithm.

关 键 词：赫夫曼树 赫夫曼编码 算法时间复杂度 静态编码算法 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]