What are the differences between iterative and recursive approaches in Python?

What are the differences between iterative and recursive approaches in Python?

Iterative approaches use loops to repeat a block of code, while recursive approaches call a function within itself.

Can you give me an example of both methods for calculating factorial?

Sure! For iterative: def factorial_iterative(n): result = 1; for i in range(1, n+1): result *= i; return result. For recursive: def factorial_recursive(n): return 1 if n == 0 else n * factorial_recursive(n-1).

Which method is more efficient in terms of memory usage?

Iterative methods are generally more memory-efficient since they don't add to the call stack like recursive methods do.

Are there any scenarios where recursion is preferred?

Yes, recursion is often preferred for problems that can be divided into smaller subproblems, like tree traversals.