Question

wirte a method in java that takes 3 parameters: an integer array , a start index i , an end index j, return the minimum element of the array whose index is between i and j inclusive. the head of the method is given below ...... public static int min (int [] a,int start, int end)

Answer 1

public class RecursiveMin {

    public static int min(int[] a, int start, int end) {
        if (start == end) {
            return a[end];
        } else {
            int smallest = min(a, start + 1, end);
            if (a[start] < smallest)
                smallest = a[start];
            return smallest;
        }
    }

    public static void main(String[] args) {
        System.out.println(min(new int[]{4, 9, 2, 7, 3, 5}, 0, 5));
    }
}