Q. The complexity of Binary search algorithm is

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

💬 Discuss

✅ Correct Answer: (B) o(log n)

Published by Shiva Ram ⭐ 30.44K Points at 08-Feb-2025 08:05 pm in Data Structure and Algorithms (DSA)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

539

Total Visits

📽️

1 y ago

Published

🎖️

Shiva Ram

Publisher

📈

85%

Success Rate