(n, cache={0: 0, 1: 1})
| 9 | |
| 10 | |
| 11 | def fib2(n, cache={0: 0, 1: 1}): |
| 12 | if n in cache: |
| 13 | return cache[n] |
| 14 | cache[n] = fib2(n - 1) + fib2(n - 2) |
| 15 | return cache[n] |
| 16 | |
| 17 | |
| 18 | def run(): |
no outgoing calls
no test coverage detected
searching dependent graphs…