What is recursion in C++ and how does it work?

What is recursion in C++ and how does it work?

Recursion in C++ is a programming technique where a function calls itself to solve a problem. It typically involves a base case to stop the recursion and a recursive case that breaks the problem into smaller subproblems.

Can you give me an example of a recursive function in C++?

Sure! Here's a simple example of a recursive function that calculates the factorial of a number:

int factorial(int n) {
    if (n <= 1) return 1; // Base case
    return n * factorial(n - 1); // Recursive case
}

What are the advantages and disadvantages of using recursion?

Advantages of recursion include simpler code and easier problem-solving for complex problems. Disadvantages include higher memory usage and potential stack overflow for deep recursion.

How can I optimize a recursive function?

You can optimize a recursive function using techniques like memoization, which stores previously computed results, or by converting it to an iterative solution to reduce memory usage.