/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

1 vote377 views1 answer
Python module install a whl
Python
0 vote356 views1 answer
How to change defaul tpython version\
Python
33 votes318 views5 answers
Install matplotlib pip
Python
22 votes341 views2 answers
Python count repeated elements in a list
Python
-2 votes345 views2 answers
String index
Python
0 vote314 views1 answer
How to kick and ban members with discord.py
Python
0 vote392 views1 answer
Tasks discord py
Python
1 vote348 views1 answer
Plt line of best fit
Python
0 vote317 views1 answer
Nested For loop in Python
Python
0 vote349 views1 answer
First and last name generator python
Python