Question

in java

Write a program that uses recursion to find the largest number in an array. Declare and initialize an array of 10 different numbers.

Answer 1

public class RecursiveLargest {

    public static int largest(int[] arr) {
        return largest(arr, arr.length);
    }

    public static int largest(int[] arr, int size) {
        if (size == 1) {
            return arr[0];
        } else {
            int large = largest(arr, size - 1);
            if (large < arr[size - 1]) {
                large = arr[size - 1];
            }
            return large;
        }
    }

    public static void main(String[] args) {
        int[] numbers = {3, 8, 1, 4, 9, 2, 6, 7, 5, 0};
        System.out.println("Largest number in array is " + largest(numbers));
    }
}