How can I convert recursive code to iterative code?

How can I convert recursive code to iterative code?

To convert recursive code to iterative code, you can use loops and a stack or queue to manage the state.

Can you give me an example of converting a recursive function to an iterative one?

Sure! For instance, the Fibonacci sequence can be computed recursively, but here's an iterative version:

def fibonacci(n):
    a, b = 0, 1
    for _ in range(n):
        a, b = b, a + b
    return a

What are the benefits of using iterative code over recursive code?

Iterative code generally uses less memory and avoids stack overflow issues, making it more efficient for large inputs.

Are there any situations where recursion is preferred?

Yes, recursion can be more intuitive and easier to read for problems like tree traversals or when the problem naturally fits a recursive structure.