Kadane's algorithm in Java

[RishikaKant]

[dimple031]

can you please assigned this issue to me?

[ankitk84]

can you please assign it to me?

[0himabindu]

please assign this to me @DHEERAJHARODE

[saku1331]

I wish to contribute. Kindly assign this to me.

[mehakbasrani]

I want to contribute. Please Assign it to me.

[devyani277]

can you please assign this to me?

[devyani277]

`// Java program to print largest contiguous array sum import java.io.; import java.util.;

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

// Function Call
static int maxSubArraySum(int a[])
{
	int size = a.length;
	int max_so_far = Integer.MIN_VALUE, max_ending_here
										= 0;

	for (int i = 0; i < size; i++) {
		max_ending_here = max_ending_here + a[i];
		if (max_so_far < max_ending_here)
			max_so_far = max_ending_here;
		if (max_ending_here < 0)
			max_ending_here = 0;
	}
	return max_so_far;
}

} `