Maximum Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [−2,1,−3,4,−1,2,1,−5,4],

the contiguous subarray [4,−1,2,1] has the largest sum = 6.

int fun(int a[], int n){	int result = a[0];	int sum = a[0];	for (int i = 1; i < n; i++)	{		sum = max(sum+a[i], a[i]);		result = max(sum, result);	}	return result;}