Massive Algorithms: Find the subarray with least average

Find the subarray with least average - GeeksforGeeks
Given an array arr[] of size n and integer k such that k <= n.

nput:  arr[] = {3, 7, 5, 20, -10, 0, 12}, k = 2
Output: Subarray between [4, 5] has minimum average

void findMinAvgSubarray(int arr[], 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 -- first step

    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);

}

}

    cout << "Subarray between [" << res_index << ", "

        << res_index + k - 1<< "] has minimum average";

}

Labels