M

Mr. Dubey • 100.69K 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!)
Share
Explanation by: Mr. Dubey
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.

Related MCQs

Q. All of the following costs are likely to decrease as a result of better quality except ______________.

Q. GBML stands for

Q. When does the ArrayIndexOutOfBoundsException occur?

Q. Which of the following is true about weighted majority votes? 1. We want to give higher weights to better performing models 2. Inferior models can ove

Q. Simplify F = (ABC)'+( AB)'C+ A'BC'+ A(BC)'+ AB'C.

Q. Let S = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21}. What is the smallest integer N > 0 such that for any set of N integers, chosen from S, there must

Q. How are variable length arguments specified in the function heading?

Q. Point out the wrong statement.

Q. Coupling is a qualitative indication of the degree to which a module

Q. How are principles of management are formed?

Question analytics