Consider that n elements are to be sorted. What is the worst case time complexity of Bubble sort?

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Data Structure and Algorithms (DSA)

Q. Consider that n elements are to be sorted. What is the worst case time complexity of Bubble sort?

(A) o(1)
(B) o(log2n)
(C) o(n)
(D) o(n^2)

💬 Discuss

✅ Correct Answer: (D) o(n^2)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

409

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

95%

Success Rate