# Recursion Tutorial

From Progzoo

Recursive functions typically have a base case and a recursive case.

## Factorial Function

The function **fact** takes a single integer input. The result is that number times by each of the numbers smaller - down to one.

fact(1) = 1 = 1 fact(2) = 1*2 = 2 fact(3) = 1*2*3 = 6 fact(4) = 1*2*3*4 = 24 fact(5) = 1*2*3*4*5 = 120

[Font]
[Default]
[Show]
[Resize]
[History]
[Profile]