-
-
Save ayubmetah/73a70790581564cd0fd2de7a2e6afb79 to your computer and use it in GitHub Desktop.
#using recursion | |
def sum_positive_numbers(n): | |
if n <= 1: | |
return n | |
return n + sum_positive_numbers(n-1) | |
print(sum_positive_numbers(3)) # Should be 6 | |
print(sum_positive_numbers(5)) # Should be 15 | |
#using normal functions | |
def sum_positive_numbers(n): | |
sums = 0 | |
for v in range(1,n+1): | |
sums += v | |
return sums | |
print(sum_positive_numbers(3)) # Should be 6 | |
print(sum_positive_numbers(5)) # Should be 15 |
It should written like this .
def sum_positive_numbers(n):
if n <= 1:
return n
return n + sum_positive_numbers (n - 1)
print (sum_positive_numbers(3))
print (sum_positive_numbers(5))
def sum_positive_numbers(n):
sum = 0
for i in range(n):
sum = (i+1) + sum
return sum
def sum_positive_numbers(n):
sums = 0
for i in range(1,n+1):
sums += i
return sums
print(sum_positive_numbers(3))
print(sum_positive_numbers(5))
def sum_positive_numbers(n):
if n < 1:
return 0
return n + (sum_positive_numbers(n-1))
print(sum_positive_numbers(3)) # Should be 6
print(sum_positive_numbers(5)) # Should be 15
def sum_positive_numbers(n):
if n < 1:
return n
return n + sum_positive_numbers(n-1)
print(sum_positive_numbers(3)) # Should be 6
print(sum_positive_numbers(5)) # Should be 15
def sum_positive_numbers(n):
if n<1:
return n==1
else:
return n+sum_positive_numbers(n-1)
print(sum_positive_numbers(3)) # Should be 6
print(sum_positive_numbers(5)) # Should be 15
use this
def sum_positive_numbers(n):
if n < 1:
return 0
else:
return n + sum_positive_numbers(n - 1)
print(sum_positive_numbers(3)) # Should be 6
print(sum_positive_numbers(5)) # Should be 15
def sum_positive_numbers(n):
if n <= 1:
return 1
return n + sum_positive_numbers(n-1)
print(sum_positive_numbers(3)) # Should be 6
print(sum_positive_numbers(5)) # Should be 15
lol you could also write
def sum_positive_numbers(n):
# The base case is n being smaller than 1
if n < 1:
return 0
print(sum_positive_numbers(3)) # Should be 6
print(sum_positive_numbers(5)) # Should be 15