In which case is Insertion Sort better than Quick Sort and Merge Sort?
2025
In which case is Insertion Sort better than Quick Sort and Merge Sort?
Answer: C. Small, nearly sorted, uses less memory — Correct answer: Small, nearly sorted input where it uses less memory. Insertion Sort has low overhead and works very efficiently on small or nearly sorted…
- A.
Large, random input
- B.
Large input, needs stable sort
- C.
Small, nearly sorted, uses less memory
- D.
Sorting linked lists
- E.
Parallel sorting of big data
Attempted by 374 students.
Show answer & explanation
Correct answer: C
Correct answer: Small, nearly sorted input where it uses less memory.
Insertion Sort has low overhead and works very efficiently on small or nearly sorted inputs. It is in-place, so it can be preferable when memory use and simple implementation matter.
Loading lesson…