-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmaximum contiguous subarray.c
38 lines (37 loc) · 1.04 KB
/
maximum contiguous subarray.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
/*Maximum contiguous array sum
By Amal Poulose amalpoulose95@hotmail.com +919446047003*/
#include<stdio.h>
int main(void)
{
int a[100],i,j,k,n,start=0,end=0,sum=0,larg=0;
printf("\n---------------------*Maximum contiguous array sum*-------------------------\n");
printf("\n----------------------------------------------------------------------------\n");
printf("Array size : ");
scanf("%d",&n);
printf("Enter array elements : ");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("\n----------------------------------------------------------------------------\n");
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
sum=0;
for(k=i;k<=j;k++)
sum=sum+a[k];
if(sum>larg)
{
start=i;
end=j;
larg=sum;
}
}
}
printf("\n----------------------------------------------------------------------------\n");
printf(" Maximum contiguous array elements is : ");
for(i=start;i<=end;i++)
printf(" %d ",a[i]);
printf("\n And sum is %d\n",larg);
printf("\n----------------------------------------------------------------------------\n");
return ;
}