Recursion Programming Exercise: Minimum of array

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

For function "recursiveMin", write the missing part of the recursive call. This function should return the minimum element in an array of integers. You should assume that "recursiveMin" is initially called with "startIndex" = 0.
int recursiveMin(int numbers[], int startIndex) { if (startIndex == numbers.length - 1) { return numbers[startIndex]; } else { return Math.min(numbers[startIndex], <<Missing a Recursive call>>); } }

[editor.getValue()]

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

Each time the recursive call is executed, startindex should be incremented so that the recursive case action passes through all the values in the array.