1.

Which of the following stable sorting algorithm takes the least time when applied to an almost sorted array?

A. Quick sort
B. Insertion sort
C. Selection sort
D. Merge sort
Answer» E.


Discussion

No Comment Found