﻿ C exercises: Find the largest sum of contiguous subarray of an array - w3resource

# C Exercises: Find the largest sum of contiguous subarray of an array

## C Array: Exercise-35 with Solution

Write a program in C to find the largest sum of contiguous subarray of an array.

Sample Solution:

C Code:

``````#include <stdio.h>

int maxSum(int a[],int n)
{
int i,j,k;
int sum,maxSum = 0;
for(i=0; i<n; i++)
{
for(j=i; j<n; j++)
{
sum = 0;
for(k=i ; k<j; k++)
{
sum = sum + a[k];
}
if(sum>maxSum)
maxSum = sum;
}
}
return maxSum;
}

int main()
{
int i;
int arr1[] = {8, 3, 8, -5, 4, 3, -4, 3, 5};

int ctr = sizeof(arr1)/sizeof(arr1);
printf("The given array is :  ");

for(i = 0; i < ctr; i++)
{
printf("%d  ", arr1[i]);
}
printf("\n");

printf("The largest sum of contiguous subarray is : %d \n", maxSum(arr1, ctr));
return 0;
}
```
```

Sample Output:

```The given array is :  8  3  8  -5  4  3  -4  3  5
The largest sum of contiguous subarray is : 21
```

Flowchart : C Programming Code Editor:

Improve this sample solution and post your code through Disqus.

What is the difficulty level of this exercise?

﻿

Inviting useful, relevant, well-written and unique guest posts