Computer Science, asked by adsf3611, 10 months ago

What is the Complexity Of Binary Search

Answers

Answered by aparnarao520

2

Answer:

Best case complexity = O(1)

Average case complexity = O(log n)

Worst case complexity = O(log n)

Explanation:

Previous Question

Next Question

Similar questions

English, 5 months ago

True or false :soapy was stoped at the luxurious cafe...

English, 5 months ago

Write a note on e waste give correct information i will amrk brainliest...

Math, 5 months ago

3) -2 4)-1 1 sin A 21. If cos ecA = 2, then + tan A 1+cOS A 1) 2 2) 1 22. If tano + cot0 = 2, then tan? 0 + cot? 0 = 1) 2 2) 4 3) 6 4) 8...

Biology, 10 months ago

Explain the working of an Human Eye...

English, 10 months ago

Rewrite these sentences in the passive: 1. We can solve the problem. 2. They had to postpone the meeting because of illness. 3. Somebody might have stolen your car if you had left the keys in it. 4. They shouldn't have played the football match in such bad weather. 5. They are repairing my piano at this moment. 6. They are watching my house.

Math, 1 year ago

If Sin theta = 1/2 , show that 3cos theta - 4 cos^2 theta =0...

English, 1 year ago

error and correction to the moon can get some little ...

Physics, 1 year ago

what is real gas and derive centripetal force mv^2/r^2...