Recursion is where a function calls itself. A recursive function must also have a base case, which is where the recursive calls stop. e.g. the factorial function (written as n!) is where you mulitply a number by a sequence of other numbers down to zero, such as 5! = 5 x 4 x 3 x 2 x 1. The recursive approach to this function would be to define 5! as 5 x 4!, then 4! as 4 x 3!, etc, until the base case where 1! = 1.