M

Mr. Dubey • 100.69K Points
Coach

Q. What is the worst case complexity of binary search using recursion?

  • (A) O(nlogn)
  • (B) O(logn)
  • (C) O(n)
  • (D) O(n2)
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. A ………………………… is general statement guide thinking and decision making and action

Q. Which are the types of integrity rule:

Q. Re-invoke, Update descriptions, reconfiguration and update composition are included in phase of service provision life cycle.

Q. Grouping ideas or details that are stored and recalled together as a unit is an example of which of the following?

Q. Which of the following is the result of a transitive dependency?

Q. 2's complement of any binary number can be calculated by

Q. What does RFID stand for?

Q. scikit-learn also provides functions for creating dummy datasets from scratch:

Q. Dynamuc Itemset Counting Algorithm was proposed by ____.

Q. What is a CPS merges technologies?

Question analytics