/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 vote296 views1 answer
Python boolean ungleich
Python
0 vote351 views1 answer
Screen.onkey python
Python
8 votes328 views1 answer
How to find no of times a elements in list python
Python
0 vote356 views1 answer
How to create a spark schema using a string
Python
3 votes301 views2 answers
Module 'cv2' has no 'imread' member
Python
0 vote309 views1 answer
Dict to csv keys as rows and subkey as columns in python
Python
0 vote328 views1 answer
Print without parenthesis
Python
0 vote297 views1 answer
Add values to add value in a matplotlib image
Python
3 votes299 views1 answer
Python get current month
Python
2 votes308 views2 answers
Roots of quadratic equation in python
Python