figure the sequential search of list of integers the sequential search when data items are stored in collection such as listwe say that they have linear or sequential relationship each data item is stored in position relative to the others in python liststhese relative positions are the index values of the individual items since these index values are orderedit is possible for us to visit them in sequence this process gives rise to our first searching techniquethe sequential search figure shows how this search works starting at the first item in the listwe simply move from item to itemfollowing the underlying sequential ordering until we either find what we are looking for or run out of items if we run out of itemswe have discovered that the item we were searching for was not present the python implementation for this algorithm is shown below the function needs the list and the item we are looking for and returns boolean value as to whether it is present the boolean variable found is initialized to false and is assigned the value true if we discover the item in the list def sequential_search(a_listitem)pos found false while pos len(a_listand not foundif a_list[pos=itemfound true elsepos pos+ return found test_list [ print(sequential_search(test_list )print(sequential_search(test_list )analysis of sequential search to analyze searching algorithmswe need to decide on basic unit of computation recall that this is typically the common step that must be repeated in order to solve the problem for searchingit makes sense to count the number of comparisons performed each comparison may or may not discover the item we are looking for in additionwe make another assumption here the list of items is not ordered in any way the items have been placed randomly into the sorting and searching