How to use 'fibonacci recursion python' in Python

Every line of 'fibonacci recursion python' code snippets is scanned for vulnerabilities by our powerful machine learning engine that combs millions of open source libraries, ensuring your Python code is secure.

All examples are scanned by Snyk Code

By copying the Snyk Code Snippets you agree to
this disclaimer
6def test_fib(self, func):
7 result = []
8 expected = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
9 for i in range(len(expected)):
10 result.append(func(i))
11 assert_equal(result, expected)
12 print('Success: test_fib')
Important

Use secure code every time

Secure your code as it's written. Use Snyk Code to scan source code in minutes – no build needed – and fix issues immediately. Enable Snyk Code

14def fibonacci(x: int):
15 if x < 0:
16 return -1
17 if x == 0:
18 return 0
19 cache = [0] * (x + 1)
20 for i in range(1, len(cache)):
21 cache[i] = -1
22 cache[1] = 1
23 return fibonacci_recur(x, cache)

Related snippets