How many times does a binary search need to execute to find its value? Recall from our lesson that the number of iterations is roughly a log base $2$ relationship.

In this exercise, you are going to calculate the maximum iterations and the actual iterations needed to find a random value in arrays of size $100,1000,10$k$,$ and $100$k$.$

You are given helper methods to calculate the maximum iterations, generate the random array, and do the binary search. You are also given a counter variable that increments each time your recursive binary method is called.

You will need to come up with the remainder of the code.

Sample Output

Array Size: $100$

Max iterations: $7$

Actual iterations: $5$

Array Size: $1000$

Max iterations: $10$

Actual iterations: $5$