more visual illustration of how typical binary search differs from an interpolation is given as follows for typical binary search finds the midpoint like soone can see that the midpoint is actually standing approximately in the middle of the preceding list this is as result of dividing by list an interpolation search on the other hand would move like soin interpolation searchour midpoint is swayed more to the left or right this is caused by the effect of the multiplier used when dividing to obtain the midpoint from the preceding imageour midpoint has been skewed to the right the remainder of the interpolation algorithm remains the same as that of the binary search except for the way the mid position is calculated for def interpolation_search(ordered_listterm)size_of_list len(ordered_list index_of_first_element index_of_last_element size_of_list while index_of_first_element <index_of_last_element