What is the running time complexity of your function? Justify

public static long exponentiation(long x, int n) {

// base case

if( n == 0)

return 1;

long temp = exponentiation(x, n/2); //calling recursive for n/2

if (n%2 == 0) // if n is even

return temp*temp;

else // if n is odd

{

if(n > 0) // n is positive

return x*temp*temp;

else // if n is negative

return (temp*temp)/x;

}

}