Binary search is a search algorithm that can efficiently determine if a sorted array of integers contain a specific number. The algorithm repeatedly divides the input array into half until the target element is found, thereby decreasing the search space by half each step. It is a significant improvement versus linear search Here is a quick explanation of how binary search works on an array that is already sorted: Calculate the middle index of the array and retrieve the middle element.