Question

Which of the following is the biggest advantage of selection sort?

(a) its has low time complexity

(b) it has low space complexity

(c) it is easy to implement

(d) it requires only n swaps under any condition

This question was posed to me in an online quiz.

This key question is from Recursion topic in chapter Recursion of Data Structures & Algorithms II

Answer 1

The correct option is (d) it requires only n swaps under any condition

For explanation: Selection sort works by obtaining least value element in each iteration and then swapping it with the current index. So it will take n swaps under any condition which will be useful when memory write operation is expensive.