Computer Science, asked by rajanand0910, 1 year ago

time complexity of binary search for unsuccessful run

Answers

Answered by VISHALKUMARV22

Answer:

After 1 iteration, , after 2 iterations …, after k iterations, Hence, in the worst case, we do iterations where each iteration is bounded by a constant. So the complexity is O(log N) (the base of the log doesn't matter in asymptotic notation).

Answered by kavetisrinija99

Answer:

O(log n)

Explanation:

Previous Question

Next Question

Similar questions

History, 6 months ago

जलद शब्द के दो पर्यायवाची शब्द...

Math, 6 months ago

how many grams are the in 10 kg ...

Computer Science, 6 months ago

1.main- fill in the blanks:- 1. A device that is used for converting printed documents or photos into electronic formats is called _______. 2. A ______ is an input device that is usually used on a laptop and works by sensing the user's finger movement and the applied pressure. 3. ________ is used in banks to read the information written on cheques. 4. ________ is an impact printer whereas...

Math, 1 year ago

give me explanation , the answer is 155 , 25 . i will mark as brainliest ...

English, 1 year ago

please answer this question ...

Science, 1 year ago

10th science state level preparatory examination 2019 key answers...

Chemistry, 1 year ago

What happens if I drink lemon water in copper utensils?

Science, 1 year ago

what is covalent bond...