Recursion

Formal definitions

• Base cases - Terminating scenario that doesn't use recursion to produce an answer.
• A set of rules that reduce all other cases toward the base case.

Examples

• $Fib(0)=1, \thinspace Fib(1)=1$ are base cases.
• $Fib(n)=Fib(n-1)+Fib(n-2), \;for \;all \;n>1$ are general recursive cases.