call to this recursive implementation of the binary search algorithm and its output is as followsstore [ print(binary_search(store )output> there only distinction between the recursive binary search and the iterative binary search is the function definition and also the way in which mid_point is calculated the calculation for the mid_point after the ((last_element_index first_element_index operation must add its result to first_element_index that way we define the portion of the list to attempt the search the binary search algorithm has worst time complexity of (log nthe half-ing of the list on each iteration follows log of the number of elements progression it goes without saying that in log is assumed to be referring to log base interpolation search there is another variant of the binary search algorithm that may closely be said to mimic morehow humans perform search on any list of items it is still based off trying to make good guess of where in sorted list of itemsa search item is likely to be found examine the following list of items for exampleto find we know to look at the right hand portion of the list our initial treatment of binary search would typically examine the middle element first in order to determine if it matches the search term