Write a recursive method that takes 3 parameters: an integer array a, and two integers first and last. The method will find the largest value in a between indices first and last, inclusive. That is, it will return the largest value in the part of the array a[first..last] . You may assume that first ? last.

Question

What will be an ideal response?

Answer 1

public static int findMax(int [] a, int first, int last)
{
if (first == last)
return a[first];

int firstValue = a[first];
int maxOfRest = findMax(a, first + 1, last);

if (firstValue > maxOfRest)
return firstValue;
else
return maxOfRest;
}