Exam-style question
Try this first
What is the time complexity of merge sort?.
- A.O(n)
- B.O(log n)
- C.O(n log n)
- D.O(n²)
Model answer
What a good answer should say
- O(n log n)
Explanation
Why this works
Merge sort has a time complexity of O(n log n).
Common mistake
No common mistake is linked to this question yet.