Computer Science, asked by shakeelahmed8250, 11 months 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

Similar questions