/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

119 votes197 views2 answers
Python iterate dictionary key value
Python
2 votes201 views2 answers
Count consecutive values in python
Python
4 votes204 views1 answer
Stack data structure python
Python
0 vote252 views1 answer
Redirect a post request django
Python
0 vote200 views1 answer
Issue AttributeError: ‘numpy.ndarray’ object has no attribute ‘index’
Python
8 votes193 views1 answer
Expand all rows pandas
Python
0 vote180 views1 answer
How to check if a list is a subset of another list
Python
0 vote206 views1 answer
Mylist = [“hello”, “bye”,”see ya”,”later”] phrase = mylist[1]
Python
0 vote211 views2 answers
Python if not none in one line
Python
3 votes301 views1 answer
Django user group check
Python Django