Write a recursive method that will find and return the largest value in an array of integers. Hint: Split the array in half and recursively find the largest value in each half. Return the larger of those two values.

What will be an ideal response?

```
public static int max(int [] data){
return max(data, 0, data.length-1);
}

public static int max(int [] data, int first, int last){
int result;

if(first == last)
result = data[first]; // only one value in the subarray
else{
int mid = (last + first)/2;
int max1 = max(data, first, mid);
int max2 = max(data, mid+1, last);
if(max1 > max2)
result = max1;
else
result = max2;
}

return result;

}
```

This code is in Methods.java..