How do recursion and iteration differ in programming?

What are the main differences between recursion and iteration?

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

Can you give me an example of each?

Sure! For recursion, a classic example is calculating factorials: factorial(n) = n * factorial(n-1). For iteration, you might use a for loop to achieve the same result.

Which one is more efficient?

Iteration is generally more memory-efficient since it doesn't involve the overhead of multiple function calls. However, recursion can be more intuitive for problems like tree traversals.

Are there any situations where recursion is preferred?

Yes, recursion is often preferred for problems that can be divided into smaller subproblems, like sorting algorithms (e.g., quicksort) or navigating complex data structures.