Q504
Which one of the following is false?
A.
Heap sort is an in-place algorithm
B.
Heap sort has O(nlogn) average case time complexity
C.
Heap sort is stable sort
AnswerD.
Heap sort is a comparison-based sorting algorithm
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board