Code Visualizer | Python

Python Fibonacci Function Visualization with DOT Notation

Visual representation of a Python Fibonacci function showcasing recursion, base case, and looping structure for calculating the Fibonacci sequence.

Prompt

def fibonacci(n):
    if n <= 1:
        return n
    else:
        return fibonacci(n-1) + fibonacci(n-2)

for i in range(10):
    print(fibonacci(i))

Answer

Python Code Visualization using DOT Notation

digraph {
    rankdir=LR;
    node [shape=box];

    Fibonacci -> Base_Case;
    Fibonacci -> Recursive_Call;
    Recursive_Call -> Fibonacci;
    Recursive_Call -> Fibonacci;
    Base_Case [shape=diamond];
    Base_Case -> return_n;
    return_n [shape=Mdiamond];

    Fibonacci_Call -> Fibonacci;
    Fibonacci_Call -> Fibonacci;

    for_loop -> range;
    range -> i;
    for_loop -> print;
    print -> fibonacci_call;
    fibonacci_call -> i;
}

Main Points:

The visualization depicts the structure of a Fibonacci function implemented in Python.
The function involves recursion to calculate the Fibonacci sequence.
The function has a base case when n is less than or equal to 1.
The recursive step involves calling the fibonacci function with n-1 and n-2.
The code includes a loop that iterates over the range of 0 to 9 and prints the result of the Fibonacci sequence at each iteration.