def recursive_countdown(x):
print('Countdown: ' + str(x))
if x == 1:
return 1
else:
return recursive_countdown(x - 1)
recursive_countdown(5)
def recursive_fib(x):
#print('Fib: ' + str(x))
if x in [0, 1]:
return x
else:
return (recursive_fib(x - 1) + recursive_fib(x -2 ))
# this algo can be easily improved if answers are indexed
print(recursive_fib(5))
print(recursive_fib(6))
print(recursive_fib(7))
print(recursive_fib(8))
print('Countdown: ' + str(x))
if x == 1:
return 1
else:
return recursive_countdown(x - 1)
recursive_countdown(5)
def recursive_fib(x):
#print('Fib: ' + str(x))
if x in [0, 1]:
return x
else:
return (recursive_fib(x - 1) + recursive_fib(x -2 ))
# this algo can be easily improved if answers are indexed
print(recursive_fib(5))
print(recursive_fib(6))
print(recursive_fib(7))
print(recursive_fib(8))
No comments:
Post a Comment
Note: only a member of this blog may post a comment.