Back to Search Start Over

Optimal heapsort algorithm

Authors :
Xunrang Gu
Yuzhang Zhu
Source :
Theoretical Computer Science. 163:239-243
Publication Year :
1996
Publisher :
Elsevier BV, 1996.

Abstract

A new heapsort algorithm is given in this paper. Its practical value is that the efficiency of it is two times as high as that of the original algorithm in Horowitz and Sahni (1978). Also, its theoretical significance lies in the order and the main term coefficient of the complexity has optimal performance.

Subjects

Subjects :
Mathematical optimization
Asymptotically optimal algorithm
General Computer Science
Smoothsort
Computer science
Heapsort
Value (computer science)
Algorithm
Computer Science(all)
Theoretical Computer Science
Term (time)

Details

ISSN :
03043975
Volume :
163
Database :
OpenAIRE
Journal :
Theoretical Computer Science
Accession number :
edsair.doi.dedup.....6811053d5585cdfbfce23482dad6f275
Full Text :
https://doi.org/10.1016/0304-3975(95)00233-2
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details