/Python/Most efficient fibonacci number algorithm

Most efficient fibonacci number algorithm

>>> def fib(n, computed = {0: 0, 1: 1}):
...     if n not in computed:
...         computed[n] = fib(n-1, computed) + fib(n-2, computed)
...     return computed[n]

Source: stackoverflow.com

Most efficient fibonacci number algorithm

>>> def fib_to(n):
...     fibs = [0, 1]
...     for i in range(2, n+1):
...         fibs.append(fibs[-1] + fibs[-2])
...     return fibs
...

Source: stackoverflow.com

Similar codes

4 votes123 views1 answer
Django include
Python
12 votes108 views5 answers
Python inf
Python
0 vote117 views1 answer
For pyton
Python
6 votes118 views2 answers
Python sort the values in a dictionary
Python
15 votes106 views6 answers
Google translation
Python
0 vote115 views1 answer
How to write flow of execution in python
Python
31 votes130 views4 answers
Python for loop counter
Python
11 votes119 views4 answers
Python create environment variable
Python
2 votes114 views2 answers
Python snippets
Python
32 votes116 views1 answer
Pandas create new column
Python