Programming and ds

Question

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

the answer turned out to be B but D should the answer because it does not have any swap operatoin.?

Comments

Selection Sort have O(n) swaps in worst case.

Answer 1

Here The answer depends on the which algorithm has minimum number of swaps among these

And Among these ,selection sort has the minimum  number of swaping complexity =O(n) always

so Selection sort is preferable here

 

answer B

Answer 2

Brother, in that question, they are interested in No.of Swaps but not on Time Complexity...

Selection sort performs, one swap for each pass ===> For n passes, it performs only n swaps

MergeSort always copy the elements in to temp Array right ? Copying means one type of swap.