Q42
Which sorting algorithm performs the fewest number of swaps on average?
A.
Heap Sort
B.
Quick Sort
C.
Selection Sort
D.
Insertion Sort
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board