Power calculation using recursive solution - do not need memoization

powerCalculation.py

  """ 
  Find the nth power of x
  n >= 1 -- int
  x >= 1 -- int
  
  find: x**n  
  
  def pow(x, n):
    # Base case
    if (n == 1):
      return x        # x**1 = x
    else:
      half = n/2
      result = pow(x, half)
      
      if (x is even):
        return result * result
      else:
        # x is odd
        return result * result * x
        
      # result = pow(x, a) * pow(x, b)
      # memo[n] = result
      # return result