variant of binary search algorithm is called interpolation search. Similar to the binary search algorithm, it works on a sorted array of elements by dividing it into two subarrays and compare a search key with an element at which the sorted array was divided. However, unlike the binary search algorithm, the interpolation search algorithm does not divide the sorted array into two even subarrays. It$,$ instead, uses the values of the search key to decide at which array's element the sorted array should be divided into two uneven suharrays and then compare the search key with that element. More formally, instead of calculating the midpoint element of the sorted array, in the binary search algorithm, as low$+$ah$-$low, the interpolation search estimates the position of the array's element at which the sorted array should be divided as low $+$ Alhighl$-$Allow$)$