Q. What is the worst case complexity of selection sort?

(A) O(nlogn)
(B) O(logn)
(C) O(n)
(D) O(n2)

💬 Discuss

✅ Correct Answer: (D) O(n2)

Published by Mr. Dubey ⭐ 111.42K Points at 16-Sep-2023 03:20 pm in Data Structure (DS)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

527

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

97%

Success Rate