Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort (if n is not very small).

Ingo Wegener

Browse the full MFCS paper archive.