Write a recursive method findMaxRecursive to find the maximum element of an array. The method will...

  

Transcribed Image Text:

Write a recursive method findMaxRecursive to find the maximum element of an array. The method will receive an array of int elements A and an extra number n which shows the number of elements in A. The method must return the maximum number of A recursively. public static int findMaxRecursive(int[] A, int n) if (n == 0) Return A[0]; int max1 = findMaxRecursive (A, n-1); if (max1> A[n-1]) return max1; else return A[n-1]; Write a recursive method findMaxRecursive to find the maximum element of an array. The method will receive an array of int elements A and an extra number n which shows the number of elements in A. The method must return the maximum number of A recursively. public static int findMaxRecursive(int[] A, int n) if (n == 0) Return A[0]; int max1 = findMaxRecursive (A, n-1); if (max1> A[n-1]) return max1; else return A[n-1];

Answer rating: 100% (QA)

Your code is almost correct but there is a small mistake In the base case when n is 0 you shou... View the full answer