Q249
What is the average number of comparisons used to heap sort a random permutation of N distinct items?
A.
2N log N-O(N)
B.
2N log N-O(N log N)
C.
2N log N-O(N log log N)
AnswerD.
2N log N-O(log N)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board