fibonacci python
# Implement the fibonacci sequence
# (0, 1, 1, 2, 3, 5, 8, 13, etc...)
def fib(n):
if n== 0 or n== 1:
return n
return fib (n- 1) + fib (n- 2)fibonacci python
# Implement the fibonacci sequence
# (0, 1, 1, 2, 3, 5, 8, 13, etc...)
def fib(n):
if n== 0 or n== 1:
return n
return fib (n- 1) + fib (n- 2)fibonacci sequence python
# WARNING: this program assumes the
# fibonacci sequence starts at 1
def fib(num):
"""return the number at index num in the fibonacci sequence"""
if num <= 2:
return 1
return fib(num - 1) + fib(num - 2)
print(fib(6)) # 8fibonacci python
# This function computes and returns fibonacci
# sequence number using Dynamic Programming
def fib(num, memo{}):
if num in memo:
return memo[num]
if num <= 2:
return 1
memo[n] = fib(num-1, memo) + fib(num-2, memo)
return memo[n]
"""
params:
int num: index of fibonacci sequence
dict memo: This object is needed to perform dynamic programming. Leave it empty
return:
int output.
complexity:
time: O(n)
memory: O(n)
"""Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
