Recursion

Recursion is a method in mathematics and computer science where a function calls itself directly or indirectly to solve a problem. Each recursive call breaks the problem into simpler subproblems, continuing until reaching a base case that stops further calls. Recursion is fundamental in tasks such as sorting, searching, and mathematical computations like factorials and Fibonacci sequences. Proper recursive design ensures termination and efficiency. Recursion contrasts with iteration, which uses loops rather than function calls. Recursive algorithms are widely studied due to their elegance and applicability.
For more information, visit the Wikipedia article on Recursion.

Children

To know recursion, you must first know recursion.