| 2 | import java.io.*; |
| 3 | public class Largestsum{ |
| 4 | static int maxSubArraySum(int nums[]){ |
| 5 | int n=nums.length; |
| 6 | int i; |
| 7 | int maximum_so_far = Integer.MIN_VALUE, maximum_ending_here = 0; |
| 8 | for (i = 0; i < n; i++){ |
| 9 | maximum_ending_here=maximum_ending_here+nums[i]; |
| 10 | if(maximum_ending_here<nums[i]) |
| 11 | maximum_ending_here=nums[i]; |
| 12 | if(maximum_so_far<maximum_ending_here) |
| 13 | maximum_so_far=maximum_ending_here; |
| 14 | } |
| 15 | return maximum_so_far; |
| 16 | } |
| 17 | public static void main(String []args){ |
| 18 | int size; |
| 19 | System.out.println("Enter size of array"); |