| 堆与贪心算法 |
| |
| 引用本文： | 龚雄兴.堆与贪心算法[J].现代计算机,2006(8):111-112. |
| |
| 作者姓名： | 龚雄兴 |
| |
| 作者单位： | 湖北襄樊学院,襄樊441003 |
| |
| 摘 要： | 堆是一种特殊的树,堆的首元素常常是堆中结点的最小或最大值.堆排序是一种比较快的排序方法,贪心算法中常常要找到最小(大)值.本文介绍了堆在贪心算法中的运用,并分析了其时间优越性.
|
| 关 键 词： | 堆 堆排序 时间复杂性 贪心算法 |
| 收稿时间： | 2006-05-18 |
| 修稿时间： | 2006-05-18 |
The Study on the Heap and the Greedy Algorithm |
| |
| GONG Xiong-xing.The Study on the Heap and the Greedy Algorithm[J].Modem Computer,2006(8):111-112. |
| |
| Authors: | GONG Xiong-xing |
| |
| Affiliation: | Hubei Xiangfim University, Xiangfan 441003 China |
| |
| Abstract: | With its first element usually being the minimum or the maximum of all the elements, heap is a kind of special tree. Heapsort is a kind of quick sort algorithm, the minimum(or maximum) can be found by the greedy algorithm. The heap and the greedy algorithm are combined in this paper. The applying of heap in the greedy is studied, and the advantage in the time complexity is analysed as well. |
| |
| Keywords: | Heapi Heapsort Time Cmplexity Greedy Algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
