Q. 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
💬 Discuss
✅ 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

👁️
951
Total Visits
📽️
3 y ago
Published
🎖️
Mr. Dubey
Publisher
📈
98%
Success Rate