The factorial function is a good example of recursion (doing things over and over), as 3! can be written as 3×(2!), which can be written as 3×2×(1!) and finally as 3×2×1×(0!). N! can therefore also be defined as N×(N-1)!, with 0! = 1.