/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

46 votes318 views3 answers
Code for making an exe file for python
Python
12 votes324 views6 answers
Python merge dictionaries
Python
0 vote324 views1 answer
Cv2.namedwindow
Python
6 votes292 views2 answers
How to generate two random numbers in python
Python
0 vote350 views1 answer
Django form label in template
Python Django
12 votes318 views6 answers
Python 2d array
Python
4 votes339 views1 answer
When was python developed
Python
0 vote315 views1 answer
Linear zoeken python
Python
0 vote325 views1 answer
How to get a summary of a column in python
Python
-1 vote336 views1 answer
The field was declared on serializer, but has not been included in the 'fields' option
Python