searching sequential search simple algorithm that search for specific item inside list it operates looping on each element (nuntil match occurs or the end is reached algorithm sequentialsearch(listitem prelist postreturn index of item if foundotherwise - index while index list count and list[index item index index end while if index list count and list[indexitem return index end if return - end sequentialsearch probability search probability search is statistical sequential searching algorithm in addition to searching for an itemit takes into account its frequency by swapping it with it' predecessor in the list the algorithm complexity still remains at (nbut in non-uniform items search the more frequent items are in the first positionsreducing list scanning time figure shows the resulting state of list after searching for two itemsnotice how the searched items have had their search probability increased after each search operation respectively