Skip to content

Instantly share code, notes, and snippets.

@unacceptable

unacceptable/fibonacci_recursion_with_caching.py

Created November 18, 2025 05:54
Show Gist options

  • Select an option

    Learn more about clone URLs
  • Save unacceptable/b76cfd576a26bb713c3d1f80cec1da9c to your computer and use it in GitHub Desktop.

Select an option

Learn more about clone URLs
Save unacceptable/b76cfd576a26bb713c3d1f80cec1da9c to your computer and use it in GitHub Desktop.
Download ZIP
Raw
fibonacci_recursion_with_caching.py
from functools import lru_cache
@lru_cache(maxsize=None)
def fibonacci(n: int) -> int:
'''
Return the n-th Fibonacci number.
'''
if n == 0:
return 0
elif n == 1:
return 1
return fibonacci(n - 1) + fibonacci(n - 2)
result = fibonacci(1000)
if result == 43466557686937456435688527675040625802564660517371780402481729089536555417949051890403879840079255169295922593080322634775209689623239873322471161642996440906533187938298969649928516003704476137795166849228875:
print("Success: https://youtu.be/2RQTq07B3oo")
else:
print(f"Failure: https://youtu.be/zSQNl4V_R88?t=58")
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment