How to solve this?

Question

Hello, does anyone know how to answer this question?

How many max comparisons would be needed to check a specific number in an array of 35 sorted integers?

Thanks.

Answer 1

Base 2 log

It has been proven the Binary search algorithm requires at most log_2(n)+1 comparisons

Log_2(35)+1 =

log(35)/log(2) + 1 = <---- change of base

SEVEN 7