A

Admin • 833K Points
Coach

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!)

Explanation by: Admin

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

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.