Get max sum of sub array in a array

Max sum of sub array

#include <iostream>
using namespace std;

int maxSumOfSubArray (int * array, int length)
{
        int sum     = 0;
        int result  = 0;
        for (int index = 0; index < length; index ++) {
                if (sum + array[index] > array[index]) {
                        sum = sum + array[index];
                }
                else {
                        sum = array[index];
                }
                result = max (result, sum);
        }
        return result;
}


int main ()
{
        //这里你需要使用连续的数组
        int a[8] = { 3,4,-4,5,-6,-5,9,4 };
        cout << maxSumOfSubArray (a, 8) << endl;
        
}