Java Program for Find the subarray with least average

// A Simple Java program to find 
// minimum average subarray

class Test {
    
    static int arr[] = new int[] { 3, 7, 90, 20, 10, 50, 40 };

    // Prints beginning and ending indexes of subarray
    // of size k with minimum average
    static void findMinAvgSubarray(int n, int k)
    {
        // k must be smaller than or equal to n
        if (n < k)
            return;

        // Initialize beginning index of result
        int res_index = 0;

        // Compute sum of first subarray of size k
        int curr_sum = 0;
        for (int i = 0; i < k; i++)
            curr_sum += arr[i];

        // Initialize minimum sum as current sum
        int min_sum = curr_sum;

        // Traverse from (k+1)'th element to n'th element
        for (int i = k; i < n; i++) 
        {
            // Add current item and remove first
            // item of previous subarray
            curr_sum += arr[i] - arr[i - k];

            // Update result if needed
            if (curr_sum < min_sum) {
                min_sum = curr_sum;
                res_index = (i - k + 1);
            }
        }

        System.out.println("Subarray between [" +
                            res_index + ", " + (res_index + k - 1) +
                            "] has minimum average");
    }

    // Driver method to test the above function
    public static void main(String[] args)
    {
        int k = 3; // Subarray size
        findMinAvgSubarray(arr.length, k);
    }
}