Algorithm : Kadane Algo for max sum sub array

#include<stdio.h>

int maxSubArraySum(int a[], int size)

{

   int max= 0, sum = 0;

   int i;

   for(i = 0; i < size; i++)

   {

     sum = sum + a[i];

     if(sum < 0)

        sum = 0;

     if(max < sum )

        max = sum;

    }

    return max_so_far;

}

 

int main()

{

   int a[] = {-2, -3, 4, -1, -2, 1, 5, -3};

   int max_sum = maxSubArraySum(a, 8);

   printf("Maximum sum is %d\n", max_sum);

   getchar();

   return 0;

}