take the list with elements at index is stored and at index is found the value nowassume that we want to find the element in the list how will the two different algorithms go about itif we pass this list to the interpolation search functionthe nearest_mid function will return value equal to just by one comparisonwe would have found the search term on the other handthe binary search algorithm would need three comparisons to arrive at the search term as illustrated in the following imagethe first mid_point calculated is the second mid_point is and the last mid_point where the search term is found is choosing search algorithm the binary search and interpolation search operations are better in performance than both ordered and unordered linear search functions because of the sequential probing of elements in the list to find the search termordered and unordered linear search have time complexity of (nthis gives very poor performance when the list is large the binary search operation on the other handslices the list in twoanytime search is attempted on each iterationwe approach the search term much faster than in linear strategy the time complexity yields (log ndespite the speed gain in using binary searchit is most it can not be used on an unsorted list of items neither is it advised to be used for list of small sizes