Question

You are given an integer array in the console program which declares and initializes it as follows, for example:

int int_array[] = {1, -3, 23, 4, 9, 2, 29, -3, 0, 2, 48, 7, 6, -1};

In that array there are n elements, where 0 < n < INT_MAX. Your program is to find the largest sum of any consecutive elements in that array. In the above example, the largest sum is obtained by adding 23, 4, 9, 2, 29, -3, 0, 2, 48, 7, and 6 (sum = 127). The largest sum is defined to be greater than 0. Consecutive elements mean their array indices are adjacent to each other, namely:

int_array[2] = 23

int_array[3] = 4

int_array[4] = 9

int_array[5] = 2

int_array[6] = 29

int_array[7] = -3

int_array[8] = 0

int_array[9] = 2

int_array[10] = 48

int_array[11] = 7

int_array[12] = 6

Other continuous elements inside the array get you a sum that is lower than the above.

Restrictions and Guidelines :

1. You may use the following code snippet. You may freely change your int_array examples in your main() to test your code. This snippet is just an example.

2. Implement the getLargestConsecutiveSum() function by filling up the function block indicated by // YOUR IMPLEMENTATION GOES HERE.

5. The answer is 127 in the above example.

============CODE SNIPPET BEGINS HERE ================

#include<iostream>
using namespace std;
int getLargestConsecutiveSum(const int[], int);
int main() {
    int int_array[] = {1, -3, 23, 4, 9, 2, 29, -3, 0, 2, 48, 7, 6, -1};
    cout << "Largest Consecutive Sum: " << getLargestConsecutiveSum(int_array, sizeof(int_array)/sizeof(*int_array));
    return 0;
}
int getLargestConsecutiveSum(const int arr[], int length) {
    // YOUR IMPLEMENTATION GOES HERE!!!
}

============CODE SNIPPET ENDS HERE ================

Answer 1

#include<iostream>

using namespace std;

int getLargestConsecutiveSum(const int[], int);

int main() {
    int int_array[] = {1, -3, 23, 4, 9, 2, 29, -3, 0, 2, 48, 7, 6, -1};
    cout << "Largest Consecutive Sum: " << getLargestConsecutiveSum(int_array, sizeof(int_array) / sizeof(*int_array));
    return 0;
}

int getLargestConsecutiveSum(const int arr[], int length) {
    int maxSum = arr[0];
    for (int i = 0; i < length; ++i) {
        int sum = 0;
        for (int j = i; j < length; ++j) {
            sum += arr[j];
            if (sum > maxSum)
                maxSum = sum;
        }
    }
    return maxSum;
}