0
[Added later – this question is not part of the original paper]
Which of the following sorting algorithms is based on the divide-and-conquer approach and has O(n log n) time complexity in all cases?
- ABubble sort
- BInsertion sort
- CMerge sort
- DSelection sort
Correct answer: C