Calculating x^n using bitmasking

#1

i have done using recursion, please help me , hoe to solve using bitmasking.

#2

int binaryExponentiation(int x,int n)
{
int result=1;
while(n>0)
{
if(n % 2 ==1)
result=result * x;
x=x*x;
n=n/2;
}
return result;
}


Hit like if u get it :slight_smile:
#3

Hey Vijay, as you are not responding to this thread, I am marking your doubt as Resolved for now. Re-open it if required.

Please mark your doubts as resolved in your course’s “Ask Doubt” section, when your doubt is resolved.