Why is Insertion Sort preferred for small or nearly sorted arrays?

Difficulty: 3/10

adaptive sorting, algorithm overhead, cache locality

Insertion Sort Use Cases

Insertion Sort has low constant overhead, is in-place, and performs very few movements when the input is already or almost sorted. Its best-case running time is O(n), making it useful as a base case inside more sophisticated algorithms such as hybrid sorting implementations.

javascript

1
Best case: O(n).
2
Average/worst case: O(n²).
3
Space: O(1) auxiliary.
4
Stable under the standard implementation.
5
Excellent for small partitions in hybrid sorting algorithms.

Scenario Questions

0-2 years experience

2-5 years experience

1Your team added a new feature that merges two sorted logs, each of size 5000, but the merge routine falls back to a generic sort for the final 30‑element tail. How would you justify using insertion sort for that tail?

Follow-up Questions