Time complexity of a recursive algorithm

Question

How can I calculate the time complexity of a recursive algorithm?

int pow1(int x,int n) {
    if(n==0){
        return 1;
    }
    else{
        return x *          


        

Answer 1

It can be a bit complex, but I think the usual way is to use Master's theorem.