def sum(n):
if n == 0:
return 0
else:
return 7 * n + 1 + sum(n - 1)
result = sum(6)
print(result)
Data Structures and Algorithms Unit Test%0D%0A13 of 2213 of 22 Items%0D%0A%0D%0A%0D%0A%0D%0A%0D%0A%0D%0A%0D%0A%0D%0A%0D%0A%0D%0A%0D%0A%0D%0A%0D%0A%0D%0AQuestion%0D%0AGiven the code for the recursive algorithm that sums the sequence of numbers from one to one hundred:%0D%0A%0D%0Adef sum(n):%0D%0A if n < 1:%0D%0A return 0%0D%0A else:%0D%0A return n + sum(n - 1)%0D%0Aresult = sum(100)%0D%0Aprint(result)%0D%0AHow could the code be altered to print the sum of the first 6 terms in the sequence, 7n+1?%0D%0A%0D%0A(1 point)%0D%0AResponses%0D%0A%0D%0Adef sum(n):%0D%0A if n <= 0:%0D%0A return 0%0D%0A else:%0D%0A return n + sum(7 * n - 6)%0D%0Aresult = sum(6)%0D%0Aprint(result)%0D%0Adef sum(n): if n <= 0: return 0 else: return n + sum(7 * n - 6) result = sum(6) print(result)%0D%0A%0D%0Adef sum(n):%0D%0A if n == 0:%0D%0A return 0%0D%0A else:%0D%0A return 7 * n + 1 + sum(n - 1)%0D%0Aresult = sum(100)%0D%0Aprint(result)%0D%0Adef sum(n): if n == 0: return 0 else: return 7 * n + 1 + sum(n - 1) result = sum(100) print(result)%0D%0A%0D%0Adef sum(n):%0D%0A if n == 0:%0D%0A return 0%0D%0A else:%0D%0A return 7 * n + 1 + sum(n - 1)%0D%0Aresult = sum(10)%0D%0Aprint(result)%0D%0Adef sum(n): if n == 0: return 0 else: return 7 * n + 1 + sum(n - 1) result = sum(10) print(result)%0D%0A%0D%0Adef sum(n):%0D%0A if n == 0:%0D%0A return 0%0D%0A else:%0D%0A return 7 * n + 1 + sum(n - 1)%0D%0Aresult = sum(6)%0D%0Aprint(result)
1 answer
3 answers