A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort

McDiarmid and Reed (1989) presented a variant of BOTTOM-UP-HEAPSORT which requires nlog 2 n+n element comparisons (for n= 2 h+1 -1) in the worst case, but requires an extra storage of n bits. Ingo Wegener (1992) has analyzed the average and worst case complexity of the algorithm which is very comple...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of computer mathematics Vol. 73; no. 3; pp. 293 - 297
Main Authors Chowdhury, Rezaul Alam, Kaykobad, M, Nath, Suman Kumar
Format Journal Article
LanguageEnglish
Published Abingdon Gordon and Breach Science Publishers 01.01.2000
Taylor and Francis
Subjects
Applied sciences
complexity
Computer science; control theory; systems
Data processing. List processing. Character string processing
Exact sciences and technology
F2.2
fine heap
G2.1
Heapsort
MDR-HEAPSORT
Memory organisation. Data processing
Software
Information retrieval
Average cas analysis
Heapsort
Algorithm
Complexity
Sorting
Online AccessGet full text

Cover

More Information
Summary:McDiarmid and Reed (1989) presented a variant of BOTTOM-UP-HEAPSORT which requires nlog 2 n+n element comparisons (for n= 2 h+1 -1) in the worst case, but requires an extra storage of n bits. Ingo Wegener (1992) has analyzed the average and worst case complexity of the algorithm which is very complex and long. In this paper we present a simplified complexity analysis of the same algorithm from a different viewpoint. For n= 2 h+1 -1, we show that it requires nlog 2 n+n element comparisons in the worst case and nlog 2 n+0.42n comparisons on the average
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0020-7160
1029-0265
DOI:10.1080/00207160008804896