You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
46 lines
1.3 KiB
Java
46 lines
1.3 KiB
Java
/*
|
|
This is a Java Program to find maximum subarray sum of an array. A subarray is a continuous portion of an array. The time complexity of the following program is O (n2).
|
|
*/
|
|
/*
|
|
* Java Program to Find the maximum subarray sum O(n^2)time
|
|
* (naive method)
|
|
*/
|
|
import java.util.Scanner;
|
|
|
|
public class MaxSubarraySum1
|
|
{
|
|
public static void main(String[] args)
|
|
{
|
|
Scanner scan = new Scanner(System.in);
|
|
System.out.println("Enter number of elements in array");
|
|
int N = scan.nextInt();
|
|
int[] arr = new int[ N ];
|
|
/* Accept N elements */
|
|
System.out.println("Enter "+ N +" elements");
|
|
for (int i = 0; i < N; i++)
|
|
arr[i] = scan.nextInt();
|
|
System.out.println("Max sub array sum = "+ max_sum(arr));
|
|
}
|
|
public static int max_sum(int[] arr)
|
|
{
|
|
int N = arr.length, max = Integer.MIN_VALUE;
|
|
for (int i = 0; i < N; i++)
|
|
{
|
|
int sum = 0;
|
|
for (int j = i; j < N; j++)
|
|
{
|
|
sum += arr[j];
|
|
if (sum > max)
|
|
max = sum;
|
|
}
|
|
}
|
|
return max;
|
|
}
|
|
}
|
|
|
|
/*
|
|
Enter number of elements in array
|
|
8
|
|
Enter 8 elements
|
|
-2 -5 6 -2 -3 1 5 -6
|
|
Max sub array sum = 7 |