maxSubarraySum.java

public class maxSubarraySum{
 public static void printmaxSubarraySum(int numbers[] ) {
 
 int currSum; 
 int maxSum=Integer.MIN_VALUE;
 int prefix[]=new int [numbers.length];

 prefix[0]=numbers[0];
 //calculate prefix array
 for (int i = 0; i < prefix.length; i++) {
 prefix[i]=prefix[i-1]+ numbers[i];
 
 }

 for(int i=0;i<numbers.length;i++){
 int start=i;
 for(int j=i;j<numbers.length;j++){
 int end=j;
 currSum = start==0 ? prefix[end] : prefix[end]- prefix[start-1];
 System.out.println(currSum);
 
 if(maxSum<currSum){
 maxSum=currSum;
 }
 
 System.out.println( );
 }
 System.out.println( );

 } 
 System.out.println("max sum = "+ maxSum);
 
 }

 public static void main(String[] args) {
 int numbers[]={1,-2,6,-1,3,2};
 printmaxSubarraySum(numbers); 
 }
}