The Worst Case Complexity of McDiarmid and Reed's Variant of Bottom-Up-Heap Sort is Less Than n log n + 1.1n.

Ingo Wegener

Browse the full STACS paper archive.