Recursion

[aniash29]

Can I get some sample program codes on Recursion.
Thank U

[Warnis]

http://lmgtfy.com/?q=c%2B%2B+recursion+examples

[buffbill]

i

nt f (int n)
{if(n<2)return n;
else return f(n-1)+ f(n-2);
}

BTH few would use this to compute Fibonacci numbers because of its inherent inefficiency.