Python · Theory

Timsort

Theory

84/268

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.

Exam tip

Idea + complexity + one tiny trace. Then say when to use built-in sort.

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.

Short notes

DefTimsort puts items in order.
RuleTimsort — know idea + O(...).
RememberTimsort — real code uses sorted() / Timsort.
TrapTimsort — implementing O(n²) in production when sorted() exists.

Python · Theory

Timsort

← All stacks

Theory

84/268

Timsort

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.

Exam tip

Idea + complexity + one tiny trace. Then say when to use built-in sort.

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.

Short notes

DefTimsort puts items in order.
RuleTimsort — know idea + O(...).
RememberTimsort — real code uses sorted() / Timsort.
TrapTimsort — implementing O(n²) in production when sorted() exists.

Timsort

Example

Short notes

Questions

Timsort

Example

Short notes

Questions