Inside the Math

Paste your code and we'll break it down line-by-line to show you exactly how the Big O complexity is calculated.

your_code

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

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

Click "Break Down Code" to see the line-by-line mathematical analysis.