Write an iterative O(Log y) function for pow(x, y) in C++

In this problem, we are given two integers x and y. Our task is to create a function that will be equivalent to pow(x,y) using an iterative approach that will complete the task in time complexity of 0(Log y).

Let’s take a few examples to understand the problem,

Input

x = 7 , y = 3

Output

343

The iterative function for pow(x,y) will iterate and update the result for odd values of y multiplying it by x and update x to x2 at every iteration.

Program to show the implementation of the solution

Example

 Live Demo

#include <iostream>
using namespace std;
void calcPower(int x, unsigned int y) {
   int result = 1;
   while (y > 0) {
      if (y & 1)
      result *= x;
      y = y >> 1;
      x = x * x;
   }
   cout<<result;
}
int main() {
   int x = 7;
   unsigned int y = 3;
   cout<<x<<" raised to "<<y<<" is ";
   calcPower(x,y);
   return 0;
}

Output

raised to 3 is 343

Sudhir sharma

Published on 17-Apr-2020 13:17:00

• Related Questions & Answers
• Find number of pairs (x, y) in an array such that x^y > y^x in C++
• Find larger of x^y and y^x in C++
• Count of pairs (x, y) in an array such that x < y in C++
• Find maximum among x^(y^2) or y^(x^2) where x and y are given in C++
• Count Distinct Non-Negative Integer Pairs (x, y) that Satisfy the Inequality x*x + y*y < n in C++
• Find a distinct pair (x, y) in given range such that x divides y in C++
• Check if a number can be expressed as x^y (x raised to power y) in C++
• What is ternary operator (? X : Y) in C++?
• Count Distinct Non-Negative Integer Pairs (x, y) that Satisfy the Inequality x*x +\ny*y < n in C++
• Write a power (pow) function using C++
• Find the value of the function Y = (X^6 + X^2 + 9894845) % 981 in C++
• Write a program to calculate pow(x,n) in C++
• Python Scatter Plot with Multiple Y values for each X
• Maximize the sum of X+Y elements by picking X and Y elements from 1st and 2nd array in C++
• pow() function for complex number in C++