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    t0 = time.time()
10    result = fib(36)
11    t1 = time.time()
12    
13    print(f"Result: {result}")
14    print(f"Time taken: {t1 - t0:.4f}s")
15
16if __name__ == "__main__":
17    main()