Define the recursive C++ function maxArray that returns the largest value in an array and adheres to the pseudocode just given.

Question

What will be an ideal response?

Answer 1

```
// Precondition: anArray[first..last] is an array of integers,
// where first <= last.
// Postcondition: Returns the largest integer in
// anArray[first..last].
double maxArray(const int anArray[], int first, int last)
{
if (first == last)
return anArray[first];
else
{
int mid = first + (last – first) / 2;
return max(maxArray(anArray, first, mid),
maxArray(anArray, mid + 1, last))
} // end if
} // end maxArray

```