Code Visualizer | Python

Python Fibonacci Function Visualization using DOT Notation

Illustration of Fibonacci function structure and recursion explained through DOT notation for n = 10, aiding comprehension of recursive calls and result calculation.

Prompt

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

n = 10
result = fibonacci(n)
print(result)

Answer

Python Code Visualization using DOT Notation

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

    fibonacci [label="fibonacci(n)"];
    base_case [label="n <= 1\nreturn n"];
    recursive_case [label="return fibonacci(n-1) + fibonacci(n-2)"];

    fibonacci -> base_case [label="n <= 1"];
    fibonacci -> recursive_case [label="n > 1"];
    recursive_case -> fibonacci [label="n-1"];
    recursive_case -> fibonacci [label="n-2"];

    n -> fibonacci;
    result -> fibonacci;
    fibonacci -> result;
    result -> print;
    print [label="print(result)"];
}

Main Points:

The DOT notation visualizes the code structure and relations of the Fibonacci function.
It shows the base case and the recursive case in the function.
The function calls itself recursively with n-1 and n-2 until it reaches the base case.
The code snippet sets n = 10, calculates the Fibonacci number for n, and prints the result.

This visualization helps in understanding the flow of the Fibonacci function and how the recursive calls are made to compute the result for a given input n.

Description

Illustration of Fibonacci function structure and recursion explained through DOT notation for n = 10, aiding comprehension of recursive calls and result calculation.