QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms

Authors:
Domenico Cantone;Gianluca Cincotti
Affiliations:
-;-
Venue:
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Year:
2000

Citing 14
Cited 0

An average case analysis of Floyd's algorithm to construct heaps

Information and Control
Quicksort without a stack

Proceedings of the 12th symposium on Mathematical foundations of computer science 1986
A variant of Heapsort with almost optimal number of comparisons

Information Processing Letters
Building heaps fast

Journal of Algorithms
Algorithms from P to NP (vol. 1): design and efficiency

Algorithms from P to NP (vol. 1): design and efficiency
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)

Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than n log n + 1.1n

Information and Computation
BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)

MFCS '90 Selected papers of the 15th international symposium on Mathematical foundations of computer science
Analysis of algorithms: computational methods and mathematical tools

Analysis of algorithms: computational methods and mathematical tools
Implementing Quicksort programs

Communications of the ACM
Algorithm 245: Treesort

Communications of the ACM
Algorithm 65: find

Communications of the ACM
Heaps on Heaps

Proceedings of the 9th Colloquium on Automata, Languages and Programming
Elementary average case analysis of Floyd''s algorithms to construct heaps

Elementary average case analysis of Floyd''s algorithms to construct heaps

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a practically efficient algorithm for the internal sorting problem. Our algorithm works in-place and, on the average, has a running-time of O(n log n) in the length n of the input. More specifically, the algorithm performs n log n + 3n comparisons and n log n + 2:65n element moves on the average. An experimental comparison of our proposed algorithm with the most efficient variants of Quicksort and Heapsort is carried out and its results are discussed.