the preceding list has elements that are accessible through the list index to find an element in the list we employ the linear searching technique this technique traverses the list of elementsby using the index to move from the beginning of the list to the end each element is examined and if it does not match the search itemthe next item is examined by hopping from one item to its nextthe list is traversed sequentially in treating the sections in this and otherswe use list with integers to enhance our understanding since integers lend themselves to easy comparison unordered linear search list containing elements and is an example of an unordered list the items in the list have no order by magnitude to perform search operation on such listone proceeds from the very first itemcompares that with the search item if match is not made the next element in the list is examined this continues till we reach the last element in the list or until match is made def search(unordered_listterm)unordered_list_size len(unordered_listfor in range(unordered_list_size)if term =unordered_list[ ]return return none the search function takes as parametersthe list that houses our data and the item that we are looking for called the search term the size of the array is obtained and determines the number of times the for loop is executed if term =unordered_list[ ]on every pass of the for loopwe test if the search term is equal to the item that the index points to if truethen there is no need to proceed with the search we return the position where the match occurred if the loop runs to the end of the list with no match being madenone is returned to signify that there is no such item in the list