Consider the recursive problem: Using recursion, find the largest element in an array.
Hint: Find the largest element in the subset containing all but the last element. Then compare that maximum to the value of the last element.
Without writing code identify:
1) The recursion's general case
2) The recursion's base case
3) Draw a recursion tree for the problem