I am trying to find the maximum value in an array of integers using recursion using the divide and conquer method using C$++.$ Below is the question from the textbook.

$2\mathrm{.}4\mathrm{.}3$ Finding the Largest Value in an Array

Suppose that you have an array anArray of integers and you want to find the largest value. You could

construct an iterative solution without too much difficulty, but instead let's consider a recursive for$-$

mulation:

Notice that this strategy fits the divide$-$and$-$conquer model that the previous binary search algorithm

used. That is$,$ we proceed by dividing the problem and conquering the subproblems, as Figure $2-12$

illustrates. However, there is a difference between this algorithm and the binary search algorithm.

Although the binary search algorithm conquers only one of its subproblems at each step, maxArray

conquers both. Because both subproblems are solved recursively, this approach is called multipath

recursion. After maxArray conquers the subproblems, it must reconcile the two solutions$-$that is$,$ it

must find the maximum of the two maximums. Figure $2-13$ illustrates the computations that are neces$-$

sary to find the largest integer in the array that contains $1,6,8,$ and $3($denoted here by