Largest Sum Contiguous Subarray - Kadane Algorithm

largestSumContiguousSubarray.java

import java.io.*;
import java.util.*;
import java.lang.Math;

class Kadane
{
	public static void main (String[] args)
	{
		int [] a = {-2, -3, 4, -1, -2, 1, 5, -3};
		//int [] a = {-2, 3, 2, -1};
		System.out.println("Maximum contiguous sum is " +
									maxSubArraySum(a));
	}

	static int maxSubArraySum(int a[])
	{
		  int size = a.length;
		  int max_global = a[0];
      int max_current = a[0];
		    
      for (int i = 1; i < size-1; i++)
		  {
			   max_current = Math.max(a[i], max_current + a[i]);
			   if( max_current > max_global ){
			     max_global = max_current;
			   }
		  } 
		  return max_global;
	}
}