All Questions
Tagged with comparison heap-sort
1 question with no upvoted or accepted answers
3
votes
0
answers
1k
views
How to determine the fewest number of comparisons for Heapsort?
I'm currently doing an exercise that asks to prove that Standard-Heapsort requires at fewest $\frac{1}{8} n \log(n) - O(n)$ comparisons, in its best case.
In its average case, Heapsort only requires $...
- 31