The Interpolation search algorithm works on a mathmatically calculated best guess approach to array searching.

The algorithm uses the lowest and highest values in the array and the number of elements to calculate the most likely location of the result.

If the most likely location is not the correct location, the algorithm uses it as either the new lowest or highest value, depending if it is lower or higher than the search value and calculates the most likely location again.

The algorithm repeats the calculation until it finds the answer, or until the visits the same location twice. If a location is visited twice, the value does not exist

Fair warning though, the interpolation algorithm can only be used where numbers or indexed values are used.