Modify the method that calculates the sum of the integers between 1 and N shown in this chapter. Have the new version match the following recursive definition: The sum of 1 to N is the sum of 1 to (N/2) plus the sum of (N/2 + 1) to N. Trace your solution using an N of 7.

Question

What will be an ideal response?

Answer 1

// Computes the sum of the numbers between n1 and n2 (inc)

public int sum (int n1, int n2)

{

int result;

if (n2-n1 == 0)

result = n1;

else

{

int mid = (n1+n2)/2;

result = sum(n1, mid) + sum(mid+1, n2);

}

return result;



}