Interested to Buy Any Domain ? << Click Here >> for more details...
You're given an array containing both positive and negative
integers and required to find the sub-array with the largest
sum (O(N) a la KBL). Write a routine in C for the above.
- 4 Answers
- 12309 Views
- I also Faced
- E-Mail Answers
Answer Posted / gopika
main()
{
int arr[100],sz,i,max,j,k,sum;
int start,end;
printf("\nEnter size :");
scanf("%d",&sz);
printf("\nEnter elements : ");
for(i=0;i<sz;i++)
scanf("%d",&arr[i]);
max=arr[0];
for(j=1;j<=sz;j++)
for(i=0;i<sz-j+1;i++)
{ sum=0;
for(k=0;k<j;k++)
{
sum+=arr[i+k];
if(sum>max)
{
max=sum;
start=i;
end=i+k;
}
}
}
printf("\nMax is %d\nStart %d\nend %d",max,start,end);
getch();
}
| Is This Answer Correct ? | 0 Yes | 1 No |
Post New Answer View All Answers
If all is successful, what should main return a) 0 b) 1 c) void
What is the most useful programming language?
What is the difference between ++ count and count ++?
What is ios flag in c++?
In c++, what is the difference between method overloading and method overriding?
Is c++ faster than c?
What is #include iostream h in c++?
what is scupper?
what are Operators and explain with an example?
How to defines the function in c++?
Does c++ have a hash table?
Explain polymorphism?
What is a hashmap c++?
What do you mean by early binding?
Define a constructor?
