mid_point (index_of_first_element index_of_last_element)/ if ordered_list[mid_point=termreturn mid_point if term ordered_list[mid_point]index_of_first_element mid_point elseindex_of_last_element mid_point if index_of_first_element index_of_last_elementreturn none let' assume we have to find the position where the item is located in the list as followsthe algorithm uses while loop to iteratively adjust the limits in the list within which to find search term so far as the difference between the starting indexindex_of_first_element and the index_of_last_element index is positivethe while loop will run the algorithm first finds the mid point of the list by adding the index of the first element ( to that of the last ( and dividing it by to find the middle indexmid_point mid_point (index_of_first_element index_of_last_element)/ in this case is not found at the middle position or index in the list if we were searching for we would have had to adjust the index_of_first_element to mid_point + but because lies on the other side of the listwe adjust index_of_last_element to mid_point-