34
Recursion
Recursion allows us to express a "complex" problem
in terms of a simpler version of itself
ultimately leading to a trivial (base) case
Example: factorial
int fac(int N) { if (N == 1) return 1;
// base case
else return N * fac(N-1);
//recursive case
}