title: Multiplication of large numbers
body: <p>While analyzing algorithms, I see that we usually assume multiplication to take single computer instruction. But this assumption is not apt when the size of the number (in terms of the number of bits). In the most basic form of multiplication, multiplying two n bit numbers usually is O(n^2). In context of this, what may be the complexity(in terms of bit operations) for calculating x^n.(x raised to the power of n) ?</p>
  
  <p>With the explained approach, the complexity to me seems to be exponential in n (but not sure of the exact figure)</p>