Back to Search Start Over

Asymptotic optimal HEAPSORT algorithm

Authors :
Yuzhang Zhu
Xunrang Gu
Source :
Theoretical Computer Science. 134(2):559-565
Publication Year :
1994
Publisher :
Elsevier BV, 1994.

Abstract

Heapsort algorithm HEAPSORT runs in a higher efficiency way. It has been improved to reduce the constant factor of the complexity. An asymptotic optimal heapsort algorithm is given in this paper. When the efficiency becomes the lowest, the constant factor of its complexity will not be more than 4 3 .

Subjects

Subjects :
Constant factor
General Computer Science
Smoothsort
Heapsort
Algorithm
Mathematics
Theoretical Computer Science
Computer Science(all)

Details

ISSN :
03043975
Volume :
134
Issue :
2
Database :
OpenAIRE
Journal :
Theoretical Computer Science
Accession number :
edsair.doi.dedup.....e1264e037a0a6d9d161518716b9dbda8
Full Text :
https://doi.org/10.1016/0304-3975(94)00113-8
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details