Binary Search is a very trivial algorithm to search a target value from a sorted array. It's popular among students of computer science and also during interviews it gets asked by the interviewer. It's easy. We take an array of integers already sorted and apply binary search on that array to figure out if the target value does present in that sorted array or not. The condition can be either present or not present. If it is present we return the array index of the element else we return -1. The algorithm is very simple, it's broken down into three parts. 1. Find and compare the middle element of the search space with the key. 2. If the key is found in the middle, just return the array index. 3. If the key is not found then choose half of the array space, based on whether the key value is smaller or greater than the mid element. a. If the key element is smaller than the mid element, then the left side of the search space will be used otherwise, the right side of the s