Q5
What is the primary advantage of Heap Sort over Quick Sort?
A.
It has a guaranteed time complexity of O(n log n) in the worst case.
AnswerB.
It is stable.
C.
It sorts the data in place.
D.
It uses less memory than Merge Sort.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board