A binary search is one of the searching techniques which is used to find an  element in an array. It works very efficiently with a sorted list. In a binary  search, the element to be searched for is compared with the middle element  of the array. If the value to be searched for is less than the middle element, we  will search in the lower half of the array and vice versa.