recursive pow function

powRecursive.java

public static int pow(int x, int n){
    int mid;
    int temp;
    if (n == 0){
        return 1;
    }
    if (n == 1){
        return x;
    }
    
    mid = n / 2;
    temp = pow(x, mid);
    
    if (n%2 == 0){
        return (temp * temp);
    }
    else{
        return (x * temp * temp);
    }
 
}

//alternate, works for negative numbers

public class Solution {
    public double pow(double x, int n) {
        if(n == 0)
            return 1;
        if(n == 1)
            return x;
        if(n%2 == 0)
            return pow(x*x, n/2);
        else{
            if(n>0)
                return x*pow(x*x, n/2);
            else
                return pow(x*x, n/2)/x;
        }
    }
}