tag:blogger.com,1999:blog-3418265334198879901.post1386776256530806702..comments2023-06-10T14:12:41.433+05:30Comments on Coders Stop: Compute the Power(x,n) in log(n) stepsAviralhttp://www.blogger.com/profile/11920144614598355124noreply@blogger.comBlogger7125tag:blogger.com,1999:blog-3418265334198879901.post-19757863283375676662010-12-29T03:09:37.045+05:302010-12-29T03:09:37.045+05:30correcting, i think.
int pow(int x, int n)
{
int...correcting, i think.<br /><br />int pow(int x, int n)<br />{<br /> int res = 1;<br /> while(n > 0){<br /> if(n % 2 == 1){<br /> res = res*x;<br /> }<br /> x = x*x;<br /> n = n/2;<br /> }<br /> return res;<br />}iamavalonhttps://www.blogger.com/profile/02470457922032008668noreply@blogger.comtag:blogger.com,1999:blog-3418265334198879901.post-24341171440416639742010-12-29T00:35:49.819+05:302010-12-29T00:35:49.819+05:30@landimatte .. good job!!!@landimatte .. good job!!!Aviralhttps://www.blogger.com/profile/11920144614598355124noreply@blogger.comtag:blogger.com,1999:blog-3418265334198879901.post-21836998073134628762010-12-29T00:08:15.471+05:302010-12-29T00:08:15.471+05:30This should do the trick (Python):
def pow(x, n):
...This should do the trick (Python):<br />def pow(x, n):<br /> res = 1<br /> while n:<br /> if n % 2 == 0:<br /> x *= x<br /> n /= 2<br /> else:<br /> res *= x<br /> n -= 1<br /> return res<br /><br />Regards,<br />MatteoAnonymoushttps://www.blogger.com/profile/08110115236431788223noreply@blogger.comtag:blogger.com,1999:blog-3418265334198879901.post-16578569131919022782010-12-28T23:39:30.715+05:302010-12-28T23:39:30.715+05:30@Imavalon: pow(2,5),pow(2,9) gives incorrect resul...@Imavalon: pow(2,5),pow(2,9) gives incorrect result.Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-3418265334198879901.post-37846647633469626042010-12-27T09:40:25.740+05:302010-12-27T09:40:25.740+05:30@banka, imavalon.. correct!!! but taking an iterat...@banka, imavalon.. correct!!! but taking an iterative approach is a better idea.....Aviralhttps://www.blogger.com/profile/11920144614598355124noreply@blogger.comtag:blogger.com,1999:blog-3418265334198879901.post-37111310277535898332010-12-26T23:15:37.204+05:302010-12-26T23:15:37.204+05:30int pow(int x, int n)
{
int res = x;
while(n >...int pow(int x, int n)<br />{<br /> int res = x;<br /> while(n > 1){<br /> res = res*res;<br /> if(n % 2 == 1){<br /> res = res * x;<br /> }<br /> n = n / 2;<br /> }<br /> return res;<br />}iamavalonhttps://www.blogger.com/profile/02470457922032008668noreply@blogger.comtag:blogger.com,1999:blog-3418265334198879901.post-47925813137537648972010-12-26T02:20:24.439+05:302010-12-26T02:20:24.439+05:30int pow(int x, int n)
{
if (n==1)
return x;
else i...int pow(int x, int n)<br />{<br />if (n==1)<br />return x;<br />else if(n==2)<br />return x*x;<br />else if(n%2)<br /> return x*pow(pow(x,n/2),2);<br /><br />else<br />return pow(pow(x,n/2),2);<br />}Pankaj Bankahttps://www.blogger.com/profile/13990414223387714193noreply@blogger.com