Question

how many iterations using a binary search are done until the element is found in an array arr {5,6,77,85,99 and key 85}

Answer 1

In this case, with an array of {5, 6, 77, 85, 99} and a target element of 85, the algorithm would need two iterations to find the element.

The first iteration would split the array in half and compare the middle element (77) with the target element (85), since the target element is greater than the middle element, it would discard the left half of the array {5,6} and continue the search in the right half of the array {77, 85, 99}.

The second iteration would again split the right half of the array in half and compare the middle element (85) with the target element (85) and find it, so the element is found at the 2nd iteration.

Therefore, in this case, 2 iterations are done to find the element 85 in the array {5,6,77,85,99} using the binary search algorithm.