Recursion
Definition
Recursion solves tasks by smaller cases of the same procedure.
A procedure in which a function or definition refers to a smaller instance of itself until a base case is reached.
Simply explained
A task calls the same procedure for smaller parts until a simple end case is reached.
Why it matters in practice
The term contributes to secure, maintainable, and high-performance web applications as well as resilient technical decisions.
Example from business
A function traverses a directory tree by recursively processing subfolders.
Limits and pitfalls
- Forgetting the base case, exceeding stack limits, or failing to recognize cyclic structures.
Origin & history
Recursion is a fundamental concept in mathematics and computer science.
Use in mid-sized companies
- Possible application: A function traverses a directory tree by recursively processing subfolders.
Frequently asked questions
What does recursion mean?
A procedure in which a function or definition refers to a smaller instance of itself until a base case is reached. What mistakes should be avoided? Forgetting the base case, exceeding stack limits, or failing to recognize cyclic structures.
Sources
Source checked on 10.10.2026. Editorial application examples are hypothetical; no evidence of real customer results.
Editorially reviewed on: