Q11
Which of the following sorting algorithms has a worst-case time complexity of O(n log n) and is also stable?
A.
Merge Sort
AnswerB.
Quick Sort
C.
Heap Sort
D.
Selection Sort
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board