How does recursion work?

Can you explain how recursion works in programming?

Sure! Recursion is a technique where a function calls itself to solve a problem. It typically has a base case to stop the recursion.

What is a base case?

A base case is a condition that stops the recursion. Without it, the function would call itself indefinitely, leading to a stack overflow.

Can you give me an example of a recursive function?

Of course! A classic example is the factorial function. It calculates the product of all positive integers up to a given number.

How does the factorial function work recursively?

The factorial function calls itself with a decremented value until it reaches 1, where it returns 1. For example, factorial(5) = 5 * factorial(4).