Recursion Programming Exercise: Largest

(function(){ window.OpenPopKa = true;}())

Write the missing base case for function "largest" such that it finds the largest number in array "numbers". Note that when "largest" is first called, "index" is 0.
int largest(int[] numbers, int index) { if <<Missing base case>> { return numbers[index]; } else if (numbers[index] > numbers[index+1]) { numbers[index+1] = numbers[index]; } return largest(numbers, index + 1); }

[editor.getValue()]

if (guess[0] != initEditor) { console.log(guess[0]); window.codeValue = guess[0]; window.progexType= "RecurTutor"; window.summexName= "RecCLargestPROG"; } else { return ""; }

Notice that the index variable is incremented every time the recursive call is executed. The base case should be executed on the last element of the array.

The index for this element is one less than the length of the array.