C++

Question

please help.
rekursif algorithma
input : 6
row : 1 2 3 4 5 6
amount : 21
https://code.sololearn.com/cjyqD2qzoNdG/?ref=app

Answer 1

Umm.

int ret_sum(int x)
{
if (x > 0) return (x + ret_sum(x-1));
return 0;
}

Answer 2

Tail recursion, to prevent stack overflow :
unsigned ssum(unsigned n, unsigned i){
if(n)
return ssum(n - 1, i + n);
return i;
}
unsigned sum(unsigned n){
return ssum(n,0);
}

Answer 3

You forgot one line in @Hasty's solution

Answer 4

okay. I'm retry.
@Baptiste

Answer 5

@Hatsy Rei don't work.

Answer 6

https://code.sololearn.com/cjyqD2qzoNdG/?ref=app