Sorting using heap structure

In this paper we present a new sorting algorithm for heaps which can sort n (=2 h+1 - 1) elements using no more than nlog 2 (n+1) - (13/12)n - 1 element comparisons in the worst case 2 (including the heap creation phase). Experimental results show that this algorithm requires only nlog 2 (n+1) - 1.2...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of computer mathematics Vol. 77; no. 3; pp. 347 - 354
Main Authors Alam Chowdhury, Rezaul, Kaykobad, M.
Format Journal Article
LanguageEnglish
Published Abingdon Gordon and Breach Science Publishers 01.01.2001
Taylor and Francis
Subjects
Applied sciences
Complexity
Computer science; control theory; systems
Data processing. List processing. Character string processing
Exact sciences and technology
F.2.2
Fine heap
Heapsort
MDR-HEAPSORT
Memory organisation. Data processing
Mergesort
Software
Merge sorting
Heapsorting
Complexity
Sorting
Online AccessGet full text

Cover

More Information
Summary:In this paper we present a new sorting algorithm for heaps which can sort n (=2 h+1 - 1) elements using no more than nlog 2 (n+1) - (13/12)n - 1 element comparisons in the worst case 2 (including the heap creation phase). Experimental results show that this algorithm requires only nlog 2 (n+1) - 1.2n element comparisons in the average case. However it requires extra space for 2 n LINK fields
ISSN:0020-7160
1029-0265
DOI:10.1080/00207160108805071