the following image shows how the adjustment occurs the index_of_first_element is adjusted and pointed to the index of mid_point+ the image only illustrates the adjustment of the midpoint in interpolation rarely does the midpoint divide the list in equal halves on the other handif the search term is lesser than the value stored at ordered_list[mid_point]then we only adjust the index_of_last_element variable to point to the index mid_point this logic is captured in the else part of the if statement index_of_last_element mid_point the image shows the effect of the recalculation of index_of_last_element on the position of the midpoint let' use more practical example to understand the inner workings of both the binary search and interpolation algorithms