/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

5 votes361 views2 answers
Compilador python online with numpy
Python
3 votes385 views1 answer
Default argument in flask route
Python Flask
3 votes302 views1 answer
Change plot size matplotlib python
Python
4 votes341 views1 answer
How to make a custom icon for pygame
Python
225 votes649 views6 answers
Import random python
Python
2 votes349 views2 answers
How to code a yes or no question in python v3.8
Python
58 votes343 views6 answers
Python Remove a character from a string
Python
0 vote336 views1 answer
How to remove first row of numpy array
Python
1 vote368 views1 answer
Pyspark new column
Python
0 vote348 views1 answer
ModuleNotFoundError: No module named 'rest_auth'
Python