79815469

Date: 2025-11-10 10:19:45
Score: 1
Natty:
Report link
def fibonacci_cache(n, cache = {0 : 0, 1 : 1}):
    if n in cache:
        return cache[n]
    else:
        cache[n] = fibonacci_cache(n - 1, cache) + fibonacci_cache(n - 2, cache)
    return cache[n]

Reasons:
  • Low length (0.5):
  • Has code block (-0.5):
  • Low reputation (1):
Posted by: no-one