| 利用赫夫曼树建立最佳判定算法 |
| |
| 引用本文： | 冯玉山. 利用赫夫曼树建立最佳判定算法[J]. 北京工业职业技术学院学报, 2002, 0(2) |
| |
| 作者姓名： | 冯玉山 |
| |
| 作者单位： | 北京工业职业技术学院 北京，100042 |
| |
| 摘 要： | 数据结构是计算机程序设计的重要理论技术基础,在软件开发中选择好正确的数据存储结构和算法是关键。赫夫曼树在程序开发和工程中均有较高的使用价值,通过实例介绍了在软件开发中如何利用赫夫曼树建立最佳判定算法,从而提高程序的执行速度。
|
| 关 键 词： | 赫夫曼树 算法 效率 |
Using Huffman Tree to Establish the Best Decision Algorithm |
| |
| Feng Yushan. Using Huffman Tree to Establish the Best Decision Algorithm[J]. Journal of beijing vocational & technical institute of industry, 2002, 0(2) |
| |
| Authors: | Feng Yushan |
| |
| Abstract: | Data structure is the important theory and technology fundamentals of computer programming. Choosing a proper data strorage structure and algorithm is the key to software developing. Huffman Tree has fairly high usefulness in the program development and engineering. This article introduces how to use Huffman Tree to establish the best decision algorithm to raise the program executive speed in software developing. |
| |
| Keywords: | Huffman Tree algorithm efficiency |
| 本文献已被 CNKI 等数据库收录！ |
