Skip to content

Maximum Subarray Sum

Kadane’s algorithm to find the subarray with the maximum sum.

package DSA.Arrays;
public class maxSubarray {
public static int maxSum(int arr[]) {
int curr;
int maxSum = Integer.MIN_VALUE;
for (int i = 0; i < arr.length; i++) {
int crr = i;
for (int idx = i; idx < arr.length; idx++) {
curr = 0;
for (int j = crr; j <= idx; j++) {
curr += arr[j];
}
if (maxSum < curr) {
maxSum = curr;
}
}
}
return maxSum;
}
public static void main(String[] args) {
int n[] = {2, 4, 6, 8, 10};
int sum = maxSum(n);
System.out.println(sum);
}
}