What is recursion explain with example?

already exists.

Would you like to merge this question into it?

already exists as an alternate of this question.

Would you like to make it the primary and merge this question into it?

exists and is an alternate of .

Recursion is when a function (procedure) calls itself.

int Fib (int n)
if ((n==1)(n==0))return 1;
else return Fib(n-1) + Fib(n-2);
+ 24 others found this useful
Thanks for the feedback!
In Bonds

Basics of Treasury Bonds and Securities Explained

Choosing the right investment is never an easy decision. What is the safest route? What is likely to yield the greatest return with the smallest risk? Are treasury bonds safe? (MORE)
In History

A Very Short Explanation of the Internet

It may seem strange, but sometimes there is a need to explain something that is so ubiquitous that you might think that it does not need an explanation. However, to explain th (MORE)

Explaining Asperger's Syndrome to Your Other Children

Having a child with Asperger's Syndrome means dealing with the reactions that follow his unusual physical and social movements. Explaining Asperger's to children helps them un (MORE)

Autism Awareness: Explaining Autism to Young Children

Explaining autism to children is a necessary part of introducing children to social situations, such as those they encounter in the park, at school or in clubs. Autism is a ve (MORE)

Straight Talk: Explaining ADHD to Children

Attention deficit hyperactivity disorder is a common condition that has the potential to severely affect how a child interacts with those around him. To make it easier both on (MORE)

Understanding Your Cholesterol Results: An Explanation for the Average Joe

It's not new that the risks of high cholesterol are not good. But do we all really understand when the cholesterol results are explained to us? Not many people do understand a (MORE)
In Uncategorized

What is the purpose of a stack in implementing a recursive procedure Explain?

there is no a prior limit on the depth of nested recursive calls (that a recursive function may call itself any no. of times), we may need to save an arbitrary number of regis (MORE)

What is lvalue explain with example?

left-value: an expression that can be target of assignement. eg: array[x+1]->field = 100; # okay 100 = 200; # NOT okay: not lvalue intvar = 100; # okay (char *)intva (MORE)