5 ms·
Here (where you have to search through Fibonacci numbers) I suspect memoization is rather the way to go: # memoized fibonacci function fibtable = {1:1, 0:1
by kasterma 16y ago
Here (where you have to search through Fibonacci numbers) I suspect memoization is rather the way to go:
# memoized fibonacci function
fibtable = {1:1, 0:1}
def fib (n):
global fibtable
if n in fibtable.keys():
return fibtable [n]
val = fib (n-1) + fib (n-2)
fibtable [n] = val
return val
- btilly 16y agoThere is no need to keep track of all previous values. last_fib = 0 fib = 1 while fib < 225000 or not is_prime(fib): last_fib, fib = fib, last_fib + fib