get_nth_root.py

def root(x, n):
    if n == 1:
        return x

    if x == 1:
        return x

    high = x if x > 1 else 1
    low = 0
    mid = (high+low)/2
    while (high - low) / 2 >= 1e-4:
        if mid ** n == x:
            return mid
        elif mid ** n > x:
            high = mid
        else:
            low = mid

        mid = (high + low) / 2

    return mid