Square root complexity

1
2
3
4
5
def fun(n):
    if n <=2:
        return 1
    else:
        return fun(int(n**0.5)) + n

What is the time-complexity of the above recursive function?

×

Problem Loading...

Note Loading...

Set Loading...