+1 vote
in Data Structures & Algorithms II by (110k points)
What is the time complexity of binary search with iteration?

(a) O(nlogn)

(b) O(logn)

(c) O(n)

(d) O(n^2)

This question was addressed to me in final exam.

My query is from Binary Search Iterative topic in portion Searching of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
 
Best answer
Correct choice is (b) O(logn)

The best explanation: T(n) = T(n/2) + theta(1)

Using the divide and conquer master theorem, we get the time complexity as O(logn).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...