β
Correct Answer: (D)
it requires only n swaps under any condition
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.
Explanation by: Mr. Dubey
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.
Discussion
Question Analytics
926
Total Visits
3 y ago
Published
Mr. Dubey
Publisher
99%
Success Rate