recursion

In computing and mathematics, a technique whereby a function or procedure calls itself into use in order to enable a complex problem to be broken down into simpler steps. For example, a function that finds the factorial of a number n (calculates the product of all the whole numbers between 1 and n) would obtain its result by multiplying n by the factorial of n − 1.