哈夫曼树在排序算法中的案例教学研究

A Case Study of Huffman Tree in Sorting Algorithm

本文对于哈夫曼树的应用进行拓展,提出一种基于哈夫曼树的内部排序算法。通过一个综合应用哈夫曼树、栈和队列的教学案例,一方面,加深学生对几种重要数据结构在算法设计中作用的认识,另一方面,鼓励学生敢于创新,引导学生从知识中体会和掌握算法设计的思维方式和技巧,从而培养学生创造性思维能力及解决实际问题的能力。

This paper expands the application of Huffman tree and proposes an internal sorting algorithm based on Huffman tree.Through a teaching case of comprehensive application of Huffman tree,Stack and Queue,on the one hand,it deepens students'understanding of the role of several important data structures in algorithm design,on the other hand,it encourages students to dare to innovate,guides students to experience and master the thinking mode and skills of algorithm design from knowledge,so as to cultivate students'creative thinking ability and ability to solve practical problems.