Q. The time complexity of binary search is O(logn).

(A) true, false
(B) false, true
(C) false, false
(D) true, true

💬 Discuss

✅ Correct Answer: (D) true, true

Published by Mr. Dubey ⭐ 111.54K Points at 13-Sep-2023 11:13 am in Data Structure and Algorithms (DSA)

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

627

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

90%

Success Rate