http://www.programmersheaven.com/user/mfarhan133/blog/ Contains the latest posts from the blog 'data structures' Wed, 14 May 2008 00:05:57 -0700 Argotic Syndication Framework 2007.3.0.1, http://www.codeplex.com/Argotic http://www.rssboard.org/rss-specification http://www.programmersheaven.com/user/mfarhan133/blog/189-recurrsion-examples/ // By muhammad farhan khan 20-02-08<br /> <br /> <br /> <br /> #include&lt;iostream.h&gt;<br /> <br /> #include&lt;conio.h&gt;<br /> <br /> <br /> <br /> int fact(int f) // f!<br /> <br /> {<br /> <br /> if(f==0)<br /> <br /> return 1;<br /> <br /> else<br /> <br /> return f*fact(f-1);<br /> <br /> }<br /> <br /> <br /> <br /> int fibonacci(int n) // series 1 1 2 3 5 8 13 sum of prev two nos<br /> <br /> { // in func n is the index no.<br /> <br /> if(n==1||n==2)<br /> <br /> return 1;<br /> <br /> else<br /> <br /> return fibonacci(n-1)+fibonacci(n-2);<br /> <br /> }<br /> <br /> <br /> <br /> double pow(int a,int b) // a^b<br /> <br /> {<br /> <br /> if(b==1)<br /> <br /> return a;<br /> <br /> else<br /> <br /> return a*pow(a,b-1);<br /> <br /> }<br /> <br /> <br /> <br /> int mul(int a,int b) // a*b //farhan production<br /> <br /> {<br /> <br /> if(b==1)<br /> <br /> return a;<br /> <br /> else<br /> <br /> return a+mul(a,--b);<br /> <br /> }<br /> <br /> <br /> <br /> int multiply(int a,int b) // sir rashid production<br /> <br /> {<br /> <br /> if(b==1)<br /> <br /> return a;<br /> <br /> else<br /> <br /> return a+multiply(a,--b);<br /> <br /> }<br /> <br /> <br /> <br /> int add(int a,int b) // a+b //farhan production<br /> <br /> {<br /> <br /> if(b==1)<br /> <br /> return ++a;<br /> <br /> else<br /> <br /> return 1+add(a,--b);<br /> <br /> }<br /> <br /> <br /> <br /> int sum(int a,int b) // sur rashid production<br /> <br /> {<br /> <br /> if(b==0)<br /> <br /> return a;<br /> <br /> else<br /> <br /> return sum(a+1,--b);<br /> <br /> }<br /> <br /> <br /> <br /> void main()<br /> <br /> {<br /> <br /> clrscr();<br /> <br /> int a;<br /> <br /> char o;<br /> <br /> do<br /> <br /> {<br /> <br /> cout&lt;&lt;"\n enter the index no "; cin&gt;&gt;a;<br /> <br /> cout&lt;&lt;"\n Answer = "&lt;&lt;sum(4,a);<br /> <br /> cout&lt;&lt;"\n\n Do you want to continue (y/n) "; cin&gt;&gt;o;<br /> <br /> }<br /> <br /> while(o=='y'|| o=='Y');<br /> <br /> getch();<br /> <br /> }; http://www.programmersheaven.com/user/mfarhan133/blog/189-recurrsion-examples/ Mon, 10 Mar 2008 04:21:19 -0700 mfarhan133