Recursive function C#

Recursive Function is a function that repeats or uses its own previous term to calculate subsequent terms and thus forms a sequence of terms .

A recursive formula is a formula that defines each term of a sequence using preceding term(s) . Recursive formulas must always state the initial term, or terms, of the sequence.

Recursion is the process of defining a problem (or the solution to a problem) in terms of (a simpler version of) itself . For example, we can define the operation “find your way home” as: If you are at home, stop moving. Take one step toward home. “find your way home”.

A classic example of recursion The classic example of recursive programming involves computing factorials . The factorial of a number is computed as that number times all of the numbers below it up to and including 1. For example, factorial(5) is the same as 5*4*3*2*1 , and factorial(3) is 3*2*1 .