Big-O of recursive functions

1
2
3
4
5
6
int pow(int N, int p){
    if(p==0)
        return 1;
    else
        return N*pow(N,p-1);
}

The function int pow(int N, int p) , given above, runs in _______.

×

Problem Loading...

Note Loading...

Set Loading...