/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 vote215 views1 answer
Python compressed for concatenate string
Python
1 vote180 views1 answer
Write a table to CSV file python
Python
20 votes181 views3 answers
Appending dataframes pandas
Python
0 vote201 views1 answer
Python notebook breakpoints
Python
0 vote185 views1 answer
Changing instance variable python inheritance
Python
0 vote275 views1 answer
Sort values within groups pandas dataframe
Python
0 vote204 views1 answer
Add silence to the end of an MP3 python
Python
0 vote188 views1 answer
Python runtime
Python
0 vote219 views3 answers
Valueerror: all strings must be xml compatible: unicode or ascii, no null bytes or control characters
Python
0 vote191 views1 answer
ModuleNotFoundError: No module named 'html5lib'
Python