Algorithms | Sorting | Question 6

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?
(A) Heap Sort
(B) Selection Sort
(C) Insertion Sort
(D) Merge Sort


Answer: (B)

Explanation:

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


Quiz of this Question



My Personal Notes arrow_drop_up



Practice Tags :

Recommended Posts:



0 Average Difficulty : 0/5.0
No votes yet.






User Actions