Write a recursive algorithm to perform x^n

rescursive_exponent.cpp

// If exp is even, split in half twice and call each recursively
// otherwise, split in half twice and call each recursively AND multiply x

// Questions: 
// What if exponent is 1? -- Then it will return x*1*1
// What if exponent is 3+? -- If even, split. If odd, multiply next split value to x

int power(int base, int exponent) {
  if (exponent == 0) return 1;
  else if (exponent%2 == 0) // if even
    return power(x, y/2)*power(x, y/2);
  else { // if odd
    return x*power(x, y/2)*power(x, y/2); 
  }