Download the file largest.cpp$,$ from D$2$L$.$

Read the definition of largest$\_$element. Does it satisfy the first two fundamental rules of recursion?

Here is the reasoning behind the recursive design of largest$\_$element:

$$ The largest value in a sub$-$array with only one element is simply the value of that element.

$$ If a sub$-$array has two or more elements, you can find the largest value by splitting the sub$-$array into two smaller sub$-$

arrays, finding the largest value in each smaller sub$-$array, and then comparing the two maximums.

Trace through the execution of the program by hand. Make a memory diagram for point one when begin is $1$ and

past$\_$end is $2.$

Hint: Because largest$\_$element makes two recursive calls, tracing its execution is not a simple matter of working

down to the base case and then returning to the original call. The base case will be reached several times$--$once with

begin $==0$ and past$\_$end $==1,$ once with begin $==1$ and past$\_$end $==2,$ and so on$.$

Submit your diagram as part of your lab report.