Which sorting algorithm is best for an already (almost) sorted array?

2025

Answer: C. Insertion sort — Insertion sort performs very well on already sorted or almost sorted arrays because few shifts are needed.

1. A.

   Merge sort

2. B.

   Quick sort

3. C.

   Insertion sort

4. D.

   Heap sort

Attempted by 332 students.