**not**expecting anyone doing this for me, just help me understand what I should do.

I'll try to explain is as well as I can.

a recursive method that calcuates the sum of 1+2+3+4+...+N. The process should occur like this: sum 1->N equals sum 1-to-(N/2) plus the sum of (N/2+1)-to-N

something like:

sum(0,10)

sum(0,5) + sum(6,10)

(0,2)+(3,5) + (6,8)+(9,10)

etc.

public sum (int n) { if(n == 1) return 1; else return sum(n/2)+sum(n/2+1)

this is just how I understand it.