Big-O of recursive functions (II)

1
2
3
4
5
6
int Fibonacci(unsigned int N){
    if (N==0 || N==1)
        return N;
    else
        return Fibonacci(N-1)+Fibonacci(N-2);
}

The function Fibonacci(N) , given above, runs in ______________.

×

Problem Loading...

Note Loading...

Set Loading...