Q206
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
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board