For which of the following conditions would a call to getMax result in infinite recursion (and...

      

Transcribed Image Text:

For which of the following conditions would a call to getMax result in infinite recursion (and likely cause a StackOverflow Exception)? Select all that apply. int getMax(int[] nums, int firstIndex) { if (firstIndex == nums.length - 1) return nums[firstIndex]; } int max = getMax(nums, firstIndex + 1); if (max < nums[firstIndex]) { max = nums[firstIndex]; } return max; If we call getMax with null and 0. If we call getMax with an empty list and 0. If we call getMax with a list of length 1 and 0. If we call getMax with a list of length 3 and 3. For which of the following conditions would a call to getMax result in infinite recursion (and likely cause a StackOverflow Exception)? Select all that apply. int getMax(int[] nums, int firstIndex) { if (firstIndex == nums.length - 1) return nums[firstIndex]; } int max = getMax(nums, firstIndex + 1); if (max < nums[firstIndex]) { max = nums[firstIndex]; } return max; If we call getMax with null and 0. If we call getMax with an empty list and 0. If we call getMax with a list of length 1 and 0. If we call getMax with a list of length 3 and 3.

Answer rating: 100% (QA)

The code snippet provided is a recursive method getMax that finds the maximum value in an array of integers It does this by comparing the current elem... View the full answer