The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than n log n + 1.1n

Performance engineering case study: heap construction

Journal of Experimental Algorithmics (JEA)

On the Performance of WEAK-HEAPSORT

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science

An Improvement on Tree Selection Sort

ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments

Pushing the Limits in Sequential Sorting

WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering

QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms

CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity

Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) comparisons

Journal of Experimental Algorithmics (JEA)

Navigation piles with applications to sorting, priority queues, and priority deques

Nordic Journal of Computing

In-place heap construction with optimized comparisons, moves, and cache misses

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science