Q395
What is the average number of comparisons used in a heap sort algorithm?
A.
N log N-O(N)
B.
O(N log N)-O(N)
C.
O(N log N)-1
D.
2N log N + O(N)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board