摘要
给出了传统堆排序算法的改进算法 .该算法降低了原算法的复杂度 ,在元素个数较大时 。
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.
出处
《西北师范大学学报（自然科学版）》
CAS
2002年第3期24-26,共3页
Journal of Northwest Normal University(Natural Science)
关键词
算法
堆排序
复杂度
algorithm
heapsort
complexity
