public class RecursPower {

  public static void main(String[] args) {
    System.out.println(recursPower(2,3));
  }

  public static double recursPower(double x, int n) {
    if(n == 0) {
      return 1;
    }
    else {
      double recurs = recursPower(x, n-1);
      double result = x * Math.pow(x, (n-1));
    //  double result = Math.pow((Math.pow(x, n/2)), 2); // just for even  (n) numbers
      System.out.println(recurs+" " +n+ " "+ x+"   r =  "+result);
      return result;
    }
  }
}

/**else {
      double recurs = recursPower(x, n-1);
      if (n%2 == 0) {
        double result = Math.pow((Math.pow(x, n/2)), 2);
       System.out.println("1 =="+result);
       return result;
      }
      else {
        double result = x * Math.pow(x, (n-1));
        System.out.println("2 ===  "+result);
        return result; */