Fast exponentiation

#1


This is my code for fast exponentiation. Why is this giving a TLE?

#2

@tanyaa.sood
Using divide and conquer technique we can observe the following recurrence
power(x, n) = power(x, n / 2) * power(x, n / 2); // else n is even
power(x, n) = x * power(x, n / 2) * power(x, n / 2); // if n is odd

reference code: