Recursion

« Back to Glossary Index

Recursion is a technique where a function calls itself to solve a problem. It is useful for problems that can be broken into smaller subproblems. Proper termination conditions are required. Example: Calculating factorial values recursively.


← Back

« Back to Glossary Index