Function maxSubArraySum

Dynamic Programming/Kadanes.cpp:5–14

This is the smallest code for kadanes algorithm

using namespace std;
//This is the smallest code for kadanes algorithm
int maxSubArraySum(int A[], int size)
{
 int ans = A[0];
    int sum = A[0];
    for(int i =1 ; i<size;i++){
       sum = max(A[i],sum+A[i]);
       ans = max(ans,sum);
    }
    return ans;
}

// Driver Code
int main()