ISRO | CS | 2011 | Algorithms | Sorting | Question 14

Last Updated :
Discuss
Comments

Which one of the following in place sorting algorithms needs the minimum number of swaps?

Quick sort

Insertion sort

Selection sort

Heap sort

This question is part of this quiz :

Sorting Algorithms Quiz,ISRO CS 2011
Tags:
DSA Quiz
ISRO
Share your thoughts in the comments