Q. What is the time complexity of the above recursive implementation of binary search?

(A) o(n)
(B) o(2n)
(C) o(logn)
(D) o(n!)

💬 Discuss

✅ Correct Answer: (C) o(logn)

Explanation: the time complexity of the above recursive implementation of binary search is o(logn).

Published by Mr. Dubey ⭐ 111.54K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

the time complexity of the above recursive implementation of binary search is o(logn).

💬 Discussion

📊 Question Analytics

👁️

287

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

94%

Success Rate