recursion

When a function or algorithm defines and calls itself, it is called recursion. This procedure is used for the calculation of partial results.

Typical recursive functions are iterations, where the iterative value after a loop pass is used as input value for the next loop calculation.

Recursions are supported by higher programming languages.