/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 vote189 views1 answer
Group by in ruby mongoid
Python
11 votes205 views2 answers
That does 1:to:3 do Python ?
Python
0 vote189 views1 answer
If condition python with index
Python
0 vote225 views1 answer
Any(iterable)
Python
0 vote227 views1 answer
List to string without loop
Python
0 vote198 views1 answer
C# script for download music from telegram channel
Python
6 votes192 views4 answers
List iteration
Python
0 vote175 views10 answers
Introduction to distutils in python
Python
24 votes194 views2 answers
Python bs4 install
Python
0 vote258 views1 answer
The module in NAME could not be imported: django.contrib.user_auth.password_validation.UserAttributeSimilarityValidator. Check your AUTH_PASSWORD_VALI
Python Django