Write a program to calculate pow(x,n) - GeeksforGeeks
Here’s an iterative version of it: //Time Complexity of optimized solution: O(logn) #include float power(float x, int y) {float temp; if( y == 0) return 1; temp = power(x, y/2); if (y%2 == 0) return temp*temp; else {if(y > 0) return x*temp*temp; else retu...