Question: Show that when all elements are distinct, the best-case running time of HEAPSORT is (n lg n).
Show that when all elements are distinct, the best-case running time of HEAPSORT is Ω(n lg n).
Step by Step Solution
3.42 Rating (168 Votes )
There are 3 Steps involved in it
Heap sort Heapsort Array Build Max Heap Array For length Array dow to 2 heapsize h... View full answer
Get step-by-step solutions from verified subject matter experts
