Files
developer-roadmap/roadmaps/r/content/recursion@VdtQNeFL8vnaHHzW6CWds.md

509 B

Recursion

Recursion is when a function calls itself, typically to break a problem into smaller versions of the same problem until it reaches a simple base case. A classic example is calculating a factorial by having the function call itself with a smaller number each time. Recursive functions need a clear stopping condition, or they will call themselves indefinitely and crash.

Visit the following resources to learn more: