ISRO | ISRO CS 2017 - May | Question 15

Last Updated :
Discuss
Comments
Which one of the following in-place sorting algorithms needs the minimum number of swaps?
Insertion Sort
Quick Sort
Heap Sort
Selection Sort

This question is part of this quiz :

Top MCQs on SelectionSort Algorithm with Answers,ISRO CS 2017 - May
Tags:
DSA Quiz
ISRO
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy