Open In App
Related Articles

Algorithms | Sorting | Question 6

Improve Article
Save Article
Like Article

Consider a situation where swap operation is very costly. Which of the following sorting algorithms should be preferred so that the number of swap operations are minimized in general?


Heap Sort


Selection Sort


Insertion Sort


Merge Sort

Answer: (B)


Selection sort makes O(n) swaps which is the minimum among all sorting algorithms mentioned above.

Hence Option(B) is the correct answer.

Quiz of this Question
Please comment below if you find anything wrong in the above post

Last Updated : 28 Jun, 2021
Like Article
Save Article
Similar Reads