How does recursion affect performance in Python?

How does recursion affect performance in Python?

Recursion can lead to increased memory usage and slower performance due to function call overhead and stack depth.

Are there any alternatives to recursion in Python?

Yes, you can use iterative solutions, such as loops, which often perform better in terms of memory and speed.

What are the limits of recursion in Python?

Python has a default recursion limit of 1000, which can be changed using sys.setrecursionlimit, but it's risky.

Can you give an example of a recursive function?

Sure! A classic example is the factorial function, defined as factorial(n) = n * factorial(n-1) for n > 0.