Fast exponentiation is a process whereby a number can be raised to an integer power in constant time by looking at the binary digits of the power.

For example take 0.9¹³. Since 13 is 1101₂ or 8+4+1 we have...

0.9¹³ = 0.9⁸⁺⁴⁺¹ = 0.9⁸ * 0.9⁴ * 0.9¹

Notice that the one's bit of 13 corresponds to a factor of 0.9¹ in the answer. The two's bit would be a factor of 0.9² if the bit were present, which it is not. The four's bit is a factor of 0.9⁴ and the eight's bit is a factor of 0.9⁸. Notice also that each successive factor is the square of the previous factor.

So our fast exponentiation algorithm is to start with a result of 1 and a factor of 0.9 (the base). Then look at the least significant bit of the power and multiply the result by the factor if it is set. Then right shift the power by one bit and multiply the factor by itself. If the new least significant bit of the power is set multiply by the new factor. Continue this process of multiplying the result by the power if the least significant bit of the power is set, shifting the power and squaring the factor until the power becomes zero.

Write a fast exponentiation function that takes a double base and an integer power and then returns base^power using fast exponentiation algorithm above. Include main code to test the function with a range of both positive and negative bases and a range of integer powers.