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

The External Heapsort

IEEE Transactions on Software Engineering

The complexity of heaps

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms

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)

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