in an unordered list of itemsthere is no guiding rule for how elements are inserted this therefore impacts the way the search is done the lack of order means that we cannot rely on any rule to perform the search as suchwe must visit the items in the list one after the other as can be seen in the following imagethe search for the term starts from the first element and moves to next element in the list thus compared with and if it is not equalwe compare with and so on till we find the search term in the list the unordered linear search has worst case running time of (nall the elements may need to be visited before finding the search term this will be the case if the search term is located at the last position of the list ordered linear search in the case where the elements of list have been already sortedour search algorithm can be improved assuming the elements have been sorted in ascending orderthe search operation can take advantage of the ordered nature of the list to make search more efficient the algorithm is reduced to the following steps move through the list sequentially if search item is greater than the object or item currently under inspection in the loopthen quit and return none