| 改进的堆排序算法及其复杂度分析 |
| |
| 引用本文： | 吴尚智.改进的堆排序算法及其复杂度分析[J].西北师范大学学报,2002,38(3):24-26. |
| |
| 作者姓名： | 吴尚智 |
| |
| 作者单位： | 西北师范大学数学与信息科学学院 甘肃兰州730070 |
| |
| 摘 要： | 给出了传统堆排序算法的改进算法，该算法降低了原算法的复杂度，在元素个数较大时，能较明显地提高算法的效率。
|
| 关 键 词： | 算法 堆排序 复杂度 |
| 文章编号： | 1001-988X(2002)03-0024-03 |
| 修稿时间： | 2001年12月17 |
Improved heapsort algorithm and its complexity analysis |
| |
| WU Shang,zhi.Improved heapsort algorithm and its complexity analysis[J].Journal of Northwest Normal University Natural Science (Bimonthly),2002,38(3):24-26. |
| |
| Authors: | WU Shang zhi |
| |
| Abstract: | A new improved heapsort algorithm is given.Compared with the old one,the constant factor of the complexity has been reduced and the efficency is increased highly when the mount of elements is bigger. |
| |
| Keywords: | algorithm heapsort complexity |
| 本文献已被 CNKI 维普 等数据库收录！ |
