Timsort — Python Technical Interview Questions & Answers
Timsort
Timsort
- Timsort orders a list. Say the idea in plain words, then complexity. Bubble/insertion/selection are O(n²) teaching sorts. Merge and heap are O(n log n). Python’s built-in sort is Timsort (O(n log n), very fast in practice).
- Dry-run Timsort on a tiny list like [4, 1, 3, 2] on the board. Interviewers care that you can trace one pass, not that you recite a textbook page.
- For Timsort in real code: sorted(a) / a.sort() is what you use. Write the algorithm only when they ask you to implement it.
- Output: [1, 2, 3, 4]. Python’s sorted() uses Timsort — O(n log n), what you use in real code.
Technical Interview Tip: Idea + complexity + one tiny trace. Then say when to use built-in sort.
Code Examples for Timsort
Example
# Timsort
print(sorted([4, 1, 3, 2]))
Output: [1, 2, 3, 4]. Python’s sorted() uses Timsort — O(n log n), what you use in real code.
How to Explain Timsort to an Interviewer
Explain Timsort as if you are teaching a junior — definition, then one tiny script.
Timsort puts items in order. Timsort — know idea + O(...).
What does the example print, and why?
[1, 2, 3, 4]
What mistake do freshers make with Timsort?
Timsort — real code uses sorted() / Timsort.