Question

f(n){
if (n < 2)
return 1
else
return f(n – 1) + n

Answer 1

What does the following algorithm return?

Answer 2

looks like a recursive function
f(1) = 1
f(2) = f(1) +2 = 3
f(3) = f(2) +3 = 6
.... and so on

Answer 3

so n!?

Answer 4

what do you need to solve for?
the function will return various outputs given an integer n

Answer 5

I want to know what does this algorithm return? f(n){
if (n < 2)
return 1
else
return f(n – 1) + n

Answer 6

for what n?

the series will look like this: 1,3,6,10,15,21,28,36 ...

Answer 7

Yes for n

Answer 8

for n.

f(n) = f(n-1) +n

im confused

Answer 9

sorry im no help, just not sure what you are asking for

Answer 10

ok no problem