Recursion function in Python

Question

Consider this basic recursion in Python:

def fibonacci(number):
    if number == 0: return 0
    elif number == 1:
        return 1
    else:
        return          


        

Answer 1

You can use the rcviz module to visualize recursions by simply adding a decorator to your recursive function.

Here's the visualization for your code above:

The edges are numbered by the order in which they were traversed by the execution. The edges fade from black to grey to indicate order of traversal: black edges first, grey edges last.

(I wrote the rcviz module on GitHub.)