What is the time and space complexity of merge sort, and when would you choose it?
PICTURE THIS: GIT FLOW
Simple meaning
Merge sort always splits and merges in O(n log n) time and uses O(n) extra space for the merge buffers.
WHY — Sorting instead of guessing?
Why interviewers care about Sorting:
who only read docs from people who shipped.
and tied to DSA work.
Name the idea, why it exists, then one short example.
End with when you use it and one common pitfall.
STEPS — What happens step by step?
Before you speak the answer, walk the interviewer through these steps:
- 1Merge sort always splits
and merges in O(n log n) time and uses O(n) extra space for the merge buffers.
- 2It is stable and
predictable, so it is preferred when worst-case guarantees or stability matter.
- 3On tiny arrays, insertion
sort can be faster due to constants.
- 4Give an example
One tiny concrete case you can say aloud.
- 5Common mistake
What juniors usually get wrong.
- 6Close
When you pick this over the alternative.
EXAMPLE — See it in action
Here's a short line you can speak, broken into clear beats:
Note: Adapt this scaffold to your own project — keep it under 60–90 seconds.
Key takeaway
Merge sort always splits and merges in O(n log n) time and uses O(n) extra space for the merge buffers. It is stable and predictable, so it is preferred when worst-case guarantees or stability matter.