pyston_recursive_fibonacci_benchmark_with_timing.py

1import time
2
3def fib(n):
4    if n < 2:
5        return n
6    return fib(n - 1) + fib(n - 2)
7
8def main():
9    n = 35
10    print(f"Calculating Fibonacci({n})...")
11    
12    start_time = time.time()
13    result = fib(n)
14    end_time = time.time()
15    
16    duration = end_time - start_time
17    print(f"Result: {result}")
18    print(f"Time taken: {duration:.4f} seconds")
19
20if __name__ == "__main__":
21    main()