case item is present item is not present best case worst case average case table comparisons used in sequential search of an ordered list if a_list[positemstop true elsepos pos+ return found test_list [ ,print(ordered_sequential_search(test_list )print(ordered_sequential_search(test_list )table summarizes these results note that in the best case we might discover that the item is not in the list by looking at only one item on averagewe will know after looking through only items howeverthis technique is still (nin summarya sequential search is improved by ordering the list only in the case where we do not find the item self check suppose you are doing sequential search of the list [ how many comparisons would you need to do in order to find the key suppose you are doing sequential search of the ordered list [ how many comparisons would you need to do in order to find the key the binary search it is possible to take greater advantage of the ordered list if we are clever with our comparisons in the sequential searchwhen we compare against the first itemthere are at most more items to look through if the first item is not what we are looking for instead of searching the sorting and searching