In general, the binary search
method needs no more than
....... comparisons. *
O [log2n)-1
O [logn]+1
O [log2n]
O [log2n]+1
Answers
Answered by
3
Answer:
[log2n]+1
Explanation:
HOPE THIS HELPS YOU!!!! IF YOU LIKE THIS ANSWER PLS MARK ME AS THE BRAINLIEST !!! AND DO FOLLOW ME!!!
Similar questions