- A method of solving a problem where the solution depends on solutions to smaller instances of the same problem. Such problems can generally be solved by iteration, but this needs to identify and index the smaller instances at programming time. At the opposite, recursion solves such recursive problems by using functions that call themselves from within their own code. The approach can be applied to many types of problems, and recursion is one of the central ideas of computer science. ← Wikipedia
- → Recursion
- Related terms: Tail call
- Previous term: Recovery time objective
- Next term: Recursive hashing
- Random term: Standard Output (webglossary.info/random 🎲)