Binary search Binary search is a classical algorithm for finding an element in a sorted array that uses splitting the array into halves.