Binary Search on Array of Integers

Check the element at the middle of the array. If that's not your element, repeat the same process by narrowing the search down to either the first half or the second half of the array. Consider the value of the middle element to choose which half to search.

Binary search
uses the 'guess a number' approach.

1. Your guess is that the middle element of the sorted array
is your answer.


Maintain start, end and mid indices to keep a track of the two subarrays formed by splitting the given array at the middle




2. If the middle element is not your answer, search the element in one of the two subarrays.



3. If the middle element is higher than the search target, search it in the first half of the array, i.e. left of the middle element.


4. If the middle element is lower than the search target, search it in the second half of the array, i.e. right of the middle element.

 
Keep repeating steps 1 to 4 until the element is found or the start and the end indices cross over each other.