Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

ISRO | ISRO CS 2011 | Question 14

  • Last Updated : 10 May, 2018

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

Answer: (C)

Explanation: Selection sort takes minimum number of swaps to sort an array. It takes maximum of O(n) comparisons to sort an array with n elements.
Refer: Selection sort

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!