/* Binary Search */
Binary search finds the position of a target value within a sorted array. We need array to be sort in order to apply binary search algorithm.
In binary we compare the target element with the middle element, if both the elements are equal we return the result else if the middle element is smallest then target element we simply move towards the upper array, else if the middle element is largest then target element we move towards lower array. We follows this process till we find the element or at max log(n) times.
Written with ♥ from Mangesh.