Square Root Time Complexity

In his dream, Chris wrote a function in Python, which takes a positive integer as the parameter.

1
2
3
4
5
6
7
def func(n):
    if n == 1:
        return 1
    val = 0
    for i in range(int(sqrt(n))):
        val += func(int(sqrt(n)))
    return val

Assume that the square root function takes constant time. What is the time complexity of this recursive function?

×

Problem Loading...

Note Loading...

Set Loading...