What is the difference between O(n) and O(n log n) in practice?
PICTURE THIS: RAG CHATBOT
Simple meaning
O(n log n) grows faster by a log factor — sorting is the classic case.
WHY — Complexity instead of guessing?
Why interviewers care about Complexity:
contrast on Complexity, not two memorised paragraphs.
the developer, then one case where picking wrong hurts.
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:
- 1O(n log n) grows
faster by a log factor — sorting is the classic case.
- 2For large n it
still beats nested loops.
- 3How it works
I compare against O(n^2) aloud.
- 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
O(n log n) grows faster by a log factor — sorting is the classic case. For large n it still beats nested loops.