Computer Science, asked by shakeelahmed8250, 1 year ago

Average and worst case complexity of binary search is o(log2(n)) ? Select one:

a. True

b. False

Answers

Answered by suyash18964

0

Answer:

YES IT IS THE TRUE STATEMENT

Previous Question

Next Question

Similar questions

Math, 6 months ago

find the area of a square if its side 2/5 times of its original length...

Math, 6 months ago

Q.10 If the cost of a pen is 25 rupees, then find the cost of 24 such pens.

Math, 6 months ago

plz solve it guys and plz follow me ...

Economy, 1 year ago

Based on the demand function what pricing strategy should apple adopt for smartwatch...

Geography, 1 year ago

A submerged weir is one in which the water level on the down streams side of the weir is:...

Math, 1 year ago

Mala's birthday on 12.03.2008. What is her age on 01.06.2018?

Math, 1 year ago

Hi...! mates.. plz help me in this question!!!! My question is:- Ajay is younger than Vijay by 5 years, the sum of their ages is 25 years. WHAT IS THE AJAY's AGE...?????

Geography, 1 year ago

what is the deepest point on earth crust...