Which sorting algorithm has a worst-case time complexity of O(n log n) and works by recursively dividing the array and merging sorted halves?
- ABubble sort
- BInsertion sort
- CMerge sort
- DSelection sort
Correct answer: C
Discussion 0
Log in or create a free account to join the discussion.
Nobody has replied yet. Start the discussion!