 The linear search uses equality only as it compares elements one-by-one from the start, ignoring any sorting.On average the interpolation search makes about log(log("n")) comparisons (if the elements are uniformly distributed), where "n" is the number of elements to be searched.In the worst case (for instance where the numerical values of the keys increase exponentially) it can make up to O("n") comparisons.