the ability to get to the portion of the list that houses search term determines to large extenthow well search algorithm will perform in the interpolation search algorithmthe mid is calculated for which gives higher probability of obtaining our search term the time complexity of the interpolation search is olog log )this gives rise to faster search compared to its variantbinary search summary in this we have examined two breeds of search algorithms the implementation of both linear and binary search algorithms have been discussed and their comparisons drawn the binary search variantinterpolation search has also been treated in this section knowing which kind of search operation to use will be relevant in subsequent in our next we shall use the knowledge that we have gained to enable us perform sorting operations on list of items