Brute force Approach
| 5 | |
| 6 | //Brute force Approach |
| 7 | int maxSubArraySum1(int a[],int n) |
| 8 | { |
| 9 | int maxSum=INT_MIN; |
| 10 | for(int i=0;i<n;i++) |
| 11 | { |
| 12 | for(int j=i;j<n;j++) |
| 13 | { |
| 14 | int sum=0; |
| 15 | for(int k=i;k<=j;k++) |
| 16 | { |
| 17 | sum+=a[k]; |
| 18 | |
| 19 | } |
| 20 | maxSum = max(maxSum,sum); |
| 21 | } |
| 22 | } |
| 23 | return maxSum; |
| 24 | } |
| 25 | |
| 26 | |
| 27 | //Cumulative Sum Approach |