what the outpot

Question

Assume we have an array A with the contents [1, 2, 5, 8, 9, 12, 15]. How many comparisons the BinarySearch algorithm will require to search for 9?

Answer 1

Low=0,high=3

Iteration 1; mid=3,arr[mid]<9

Low=4,high=6,

Iteration 2;mid=5,arr[mid]>9

Low=4,high=5

Iteration 3;mid=4(4.5->int) arr[mid]==9

So 3 comparisons are required