Naive recursion vs memoization vs iteration vs matrix exponentiation vs Binet's formula — race them live, then explore the golden ratio. Full benchmarked Python lab in the repo.
Real timings, measured in your browser with performance.now() — nothing hardcoded. Naive recursion is skipped above n=35: it would freeze the tab (n=40 needs ~200M calls).
| Algorithm | Complexity | Time | Result |
|---|---|---|---|
| Press race… | |||
Matrix exponentiation with exact BigInt arithmetic — no float rounding, no 250-term cap. Try n = 1000 or 5000.
Custom swing high / low. Levels match retracement.py exactly (61.8% = 1/φ). Educational only — not financial advice.
| Level | Price |
|---|---|
| Enter a swing and calculate… | |
fib(n+1) / fib(n) → φ = 1.6180339887…