Interpolation search algorithm

def InterpolationSearchAlgorithm(wantedItem: int, sortedItems: list):
    """
        => Algorithm Name: Interpolation search
        => Algorithm Type: search algorithms
        => Time Complexity: 
            [best case]     => O(1)
            [average case]  => O(log2(log2 n))
            [worst case]    => O(n)
        => Space Complexity => O(1)
        => Algorithm
            [1] =>  calculating the pos using the formula above
            [2] =>  if `array[pos] == wantedElement`: return pos
            [3] =>  if `array[pos] > wantedElement` : `high = pos - 1`
            [4] =>  if `array[pos] < wantedElement` : `low = pos + 1`
            [5] =>  stay repeating until the `array[pos] == wantedElement` or the sub-array reduces to zero.
        => params
            (wantedItem) => int
            (sortedItems) => sorted list and equally distributed.
        => Returns 
            (index) if the wanted item exists in the sortedItems
            (False) if the wanted item doesn't exist 
    """
    low = 0 
    high = len(sortedItems) - 1
    while (high >= low and sortedItems[high] >= wantedItem and sortedItems[low] <= wantedItem):
        # formula of interpolation sort
        pos = low + ((high - low) // (sortedItems[high] - sortedItems[low]) *
                    (wantedItem - sortedItems[low]))

        if sortedItems[pos] == wantedItem:
            # if it match return his index (pos)
            return pos
        elif sortedItems[pos] < wantedItem:
            # if A[pos] is smaller than wantedItem
            low = pos + 1
        else:
            # if A[pos] is larger than wantedItem
            high = pos - 1
    return False