the worst case time complexity of an ordered linear search is (nin generalthis kind of search is considered inefficient especially when dealing with large data sets binary search binary search is search strategy used to find elements within list by consistently reducing the amount of data to be searched and thereby increasing the rate at which the search term is found to use binary search algorithmthe list to be operated on must have already been sorted the binary term carries number of meanings and helps us put our minds in the right frame to understand the algorithm binary decision has to be made at each attempt to find an item in the list one critical decision is to guess which part of the list is likely to house the item we are looking for would the search term be in the first half of second half of the listthat isif we always perceive the list as being comprised of two partsinstead of moving from one cell of the list to the otherif we employ the use of an educated guessing strategywe are likely to arrive at the position where the item will be found much faster as an examplelets take it that we want to find the middle page of page book we already know that every book has its pages numbered sequentially from upwards so it figures that the th page should be found right at the middle of the bookinstead of moving and flipping from page to reach the th page let' say we decide to now look for the page we can still use our strategy to find the page easily we guess that page cuts the book in half page will lay to the left of the book no need to worry about whether we can find th page between page and because it can never be found there so using page as referencewe can open to about half of the pages that lay between the st and th page that brings us closer to finding the th page the following is the algorithm for conducting binary search on an ordered list of itemsdef binary_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