Best and the worst case timing complexities of insertion sort are_________.

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Data Structure and Algorithms (DSA)

Q. Best and the worst case timing complexities of insertion sort are_________.

(A) o(n2), o(n2)
(B) o(n log n), o(n2)
(C) o(n), o(n2)
(D) o(n), o(n3)

💬 Discuss

✅ Correct Answer: (C) o(n), o(n2)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

906

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

82%

Success Rate