/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 vote270 views1 answer
Ipaddress in python
Python
1 vote317 views2 answers
How to access cookies in django
Python Django
2 votes276 views4 answers
How to do fibonacci sequence in python
Python
0 vote282 views1 answer
How to write to a netcdf file using xarray
Python
1 vote281 views1 answer
How to sort a list by the second element in tuple python
Python
2 votes275 views2 answers
Python __repr__
Python
1 vote292 views3 answers
Python ord()
Python
0 vote273 views1 answer
Revit dynamo select all categories
Python
0 vote401 views1 answer
AttributeError: 'QuerySet' object has no attribute django
Python Django
6 votes291 views1 answer
Change dataframe value by index
Python