A Simple Modification of Xunrang and Yuzhang'S HEAPSORT Variant Improving its Complexity Significantly
Ingo Wegener · The Computer Journal · 1993
Xunrang and Yuzhang have presented the HEAPSORT variant NEWheapsort whose worst case complexity is (4/3)n log 2 n+O(n). By a simple modification this algorithm can he improved to have a better average case complexity and a worst case complexity of only (7/6)n log 2 n+O(n)