five sorting and searching objectives to be able to explain and implement sequential search and binary search to be able to explain and implement selection sortbubble sortmerge sortquick sortinsertion sortand shell sort to understand the idea of hashing as search technique to introduce the map abstract data type to implement the map abstract data type using hashing searching we will now turn our attention to some of the most common problems that arise in computingthose of searching and sorting in this section we will study searching we will return to sorting later in the searching is the algorithmic process of finding particular item in collection of items search typically answers either true or false as to whether the item is present on occasion it may be modified to return where the item is found for our purposes herewe will simply concern ourselves with the question of membership in pythonthere is very easy way to ask whether an item is in list of items we use the in operator in [ , , , , false in [ , , , , true even though this is easy to writean underlying process must be carried out to answer the question it turns out that there are many different ways to search for the item what we are interested in here is how these algorithms work and how they compare to one another