Q29
Which sorting algorithm uses a divide-and-conquer approach but is not comparison-based?
A.
Heap Sort
B.
Merge Sort
C.
Radix Sort
AnswerD.
Quick Sort
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board