Which one of the following in place sorting algorithms needs the minimum…
PYQ GATE 2006
Which one of the following in place sorting algorithms needs the minimum number of swaps?
- A.
Quick sort
- B.
Insertion sort
- C.
Selection sort
- D.
Heap sort
Attempted by 1034 students.
Sign up free to check your answer
Sign up freeLoading lesson…