Function maxSubArraySum3

A-Array/MaximumSumSubarray.cpp:54–68

kadene's algorithm

//kadene's algorithm
int maxSubArraySum3(int a[],int n)
{
    int currsum=0;
    int maxSum=INT_MIN;
    for(int i=0;i<n;i++)
    {
        currsum+=a[i];
        if(currsum<0)//keep on updting currsum if its less than zero.
        {
            currsum=0;
        }
        maxSum=max(maxSum,currsum);
    }
    return maxSum;
}

int main() {
    int n;