What is the number of swaps required to sort n elements using selection sort, in the worst case?

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Data Structure and Algorithms (DSA)

Q. What is the number of swaps required to sort n elements using selection sort, in the worst case?

(A) Θ(n)
(B) Θ(n log n)
(C) Θ(n2)
(D) Θ(n2 log n)

💬 Discuss

✅ Correct Answer: (A) Θ(n)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

421

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

97%

Success Rate