Definition, Meaning & Synonyms

recursion

noun

/rɪˈkɜːr.ʒən/

Definition

Recursion is a process in which a function calls itself directly or indirectly in order to solve a problem.

Examples

In computer science, many algorithms are designed with recursion to efficiently solve complex problems.
The factorial function can be defined using recursion, where the function calls itself to compute the value.

Meaning

In programming and mathematics, recursion is a way to solve a problem by breaking it down into simpler sub-problems of the same type. Each call to the recursive function is designed to bring the solution closer to the base case, which stops the recursion.