In which case is Insertion Sort better than Quick Sort and Merge Sort?
PYQ IBPS SO CRP SPL-XV (2025)
In which case is Insertion Sort better than Quick Sort and Merge Sort?
- 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 52 students.
Sign up free to check your answer
Sign up freeLoading lesson…

