#include <stdio.h>
main()
{
float x;
int n;
printf("\n enter values of x an n");
printf("\n %.4f to the power of % d is %.4f",x,n,power(x,n));
}
float power(float x, int n)
{
if (x==0)
{
return 0;
}
else if(n==0)
{
return 1;
}
else if (n>0)
{
return( x* power(x,n-1));
}
else
{
return ((1/x)*power(x,n+1));
}
}
|
Go4Expert Member
|
|
| 17Mar2008,16:05 | #2 |
|
|
nice one
|
|
Go4Expert Member
|
|
| 8Apr2008,00:15 | #3 |
|
This is a simple implementation of a standard algorithm & is a classic example of Tail Recursion - the form of recursion which is redundant & can be replaced by a simpler, more efficient iterative equivalent (as Pradeep has done in his article of the same program - click here)
Regards, Rajiv Iyer PS: Tail Recursion's classic trademark identification signature is that the recursive calls are usually the last statements within the recursive function's body. |
|
Light Poster
|
|
| 14Apr2008,17:54 | #4 |
|
|
i cannot understand this.please do it in an easy way
|
|
Light Poster
|
|
| 21Apr2008,12:36 | #5 |
|
|
thank you rashida.you have done it in a very easy way
|
|
Newbie Member
|
|
| 28Apr2008,03:34 | #6 |
|
|
How do you do this manually in C++ without using the Power functionality?
|
|
Go4Expert Member
|
|
| 20May2008,10:25 | #7 |
|
thats excellent especially the negative sides.... can u help me for me to learn using recursion in C
|
|
TechCake
|
|
| 20May2008,16:30 | #8 |
|
|
Quote:
Originally Posted by wagmare http://www.go4expert.com/showthread.php?t=10396 |