The maximum-valued element of an integer -valued array can be recursively calculated as follows

1
The maximum-valued element  of an integer -valued  array can be recursively calculated as follows

LANGUAGE: JAVA

CHALLENGE:

The maximum-valued element of an integer -valued array can be recursively calculated as follows:
• If the array has a single element , that is its maximum (note that a zero-sized array has no maximum)
• Otherwise, compare the first element with the maximum of the rest of the array — whichever is larger is the maximum value .
Write an int method named max that accepts an integer array , and the number of elements in the array and returns the largest value in the array . Assume the array has at least one element .

SOLUTION:

public static int max(int[] array, int n){
    if(n==1)
        return array[0];
    else{
        int local = max(array,n-1);
        if(array[n-1] > local)
            return array[n-1];
        else
            return local;
    }
}


One comment

  • swiftintruder says:

    public static int max(int[] array, int n){
    if(n==1)
    return array[0];
    else{
    int local = max(array,n-1);
    if(array[n-1] > local)
    return array[n-1];
    else
    return local;
    }
    }

Add comment