ool Computer Science A

UNIT $3$

LESSON $9$

Data Structures and Algorithms

Recursive Algorithms

Recursive Algorithms Quick Check

Given the code for the recursive algorithm that sums the sequence of numbe from one to one hundred:

def ${\displaystyle \underset{?}{\overset{?}{}}}(n)$ :

if $n<mn\; id="EditorElement\_9118924">1</mn>$ :

return $0$

else:

return $n+{\displaystyle \underset{?}{\overset{?}{}}}(n-1)$

result $={\displaystyle \underset{?}{\overset{?}{}}}(160)$

print$($result$)$

How could the code be altered to print the sum of the first $10$ numbers in the sequence $3n-1?$