I need some help with recursive methods.

Here's a method.

public int m1(int n)

{

If(n==1)

return 25;

else

return n + m1(n-1)

}

then you solve for:

m1(6)

alright, so I get you this up to the 25. How does the 25 get there, why wouldn't it be 1+m1(0)? and the answer for the problem is 45. Could someone explain how you get 25 and 45?

6+m1(5)

5+m1(4)

4+m1(3)

3+m1(2)

2+ m1(1)

25

m1(6)==45

thanks.

[471 byte] By [fighterfish13a] at [2007-10-2 18:27:03]