/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

0 vote310 views1 answer
Lamda in f string
Python
0 vote312 views1 answer
Pandas reemplazar nan por cero
Python
0 vote354 views1 answer
Is there a gif package for python
Python
0 vote346 views1 answer
Python fibonacci sequence for loop
Python
0 vote316 views1 answer
Can i register a list in python for input
Python
0 vote327 views1 answer
Array search with regex python
Python
1 vote335 views2 answers
How to run single loop iterations on same time in python
Python
0 vote333 views1 answer
Access dict elements with dot
Python
0 vote390 views1 answer
Case insensitive replace python
Python
11 votes333 views4 answers
Python execute shell command and get output
Python