What are the differences between recursion and iteration in C++?

What are the differences between recursion and iteration in C++?

Recursion involves a function calling itself, while iteration uses loops. Recursion can be more elegant but may use more memory.

Can you give me an example of both in C++?

Sure! For recursion, a factorial function could look like this:

int factorial(int n) {
    return (n == 1) ? 1 : n * factorial(n - 1);
}

For iteration:

int factorial(int n) {
    int result = 1;
    for (int i = 2; i <= n; i++) {
        result *= i;
    }
    return result;
}

Which method is more efficient?

Iteration is generally more efficient in terms of memory usage, as recursion can lead to stack overflow for large inputs.

When should I use recursion instead of iteration?

Use recursion when the problem is naturally recursive, like tree traversals or when the code readability is a priority.