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?

  1. A.

    Large, random input

  2. B.

    Large input, needs stable sort

  3. C.

    Small, nearly sorted, uses less memory

  4. D.

    Sorting linked lists

  5. E.

    Parallel sorting of big data

Attempted by 52 students.

Sign up free to check your answer

Sign up free

Explore the full course: Ibps So It Mains

Loading lesson…