Re: Recursive function to find X to the power n
nice one

Re: Recursive function to find X to the power n
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. 
Re: Recursive function to find X to the power n
i cannot understand this.please do it in an easy way

Re: Recursive function to find X to the power n
thank you rashida.you have done it in a very easy way

Re: Recursive function to find X to the power n
How do you do this manually in C++ without using the Power functionality?

Re: Recursive function to find X to the power n
thats excellent especially the negative sides.... can u help me for me to learn using recursion in C

Re: Recursive function to find X to the power n
Quote:
http://www.go4expert.com/showthread.php?t=10396 
All times are GMT +5.5. The time now is 02:13. 