def recursion(n):
if n < 1:
return 0
result = recursion(n-1)
return result
print(recursion(5))
def recursion(n):
if n < 1:
return 0
print(n)
result = recursion(n-1)
return result
recursion(5)
def recursion(n):
if n < 1:
return 0
result = recursion(n-1)
print(n)
return result
recursion(5)
def recursion(n):
if n < 1:
return 0
print(n)
result = recursion(n-1)
print(n)
return result
recursion(5)
def recursion(n):
if n < 1:
return 0
result = n + recursion(n-1)
return result
print(recursion(5))
def recursion(n):
if n < 1:
return 0
print(n)
result = n + recursion(n-1)
print(n)
return result
print(recursion(5))
def recursion(n):
if n < 1:
return 0
if n ==1:
return 1
print(n)
result = recursion(n-1) + recursion(n-2)
return result
print(recursion(4))
def recursion(n):
if n < 1:
return 0
if n ==1:
return 1
print(n)
result = recursion(n-2) + recursion(n-1)
return result
print(recursion(4))
def recursion(n):
if n < 1:
return 0
if n ==1:
return 1
print(n)
result = recursion(n-1) + recursion(n-2)
print(n)
return result
print(recursion(4))
def recursion(n):
if n < 1:
return 0
if n ==1:
return 1
print(n)
result = recursion(n-2) + recursion(n-1)
print(n)
return result
print(recursion(4))
data = [-1] * 10
def recursion(n):
if n < 1:
return 0
if n ==1:
return 1
print(n)
if data[n] == -1
result = recursion(n-1) + recursion(n-2)
data[n] = result
else:
result = data[n]
return result
print(recursion(4))
data = [-1] * 10
def recursion(n):
if n < 1:
return 0
if n ==1:
return 1
print(n)
if data[n] == -1
result = recursion(n-1) + recursion(n-2)
data[n] = result
else:
result = data[n]
print(n)
return result
print(recursion(4))