Java Algorithm Create a simple program that implements a br

Java Algorithm -

Create a simple program that implements a brute force algorithm to find the maximum subarray.

Solution

/*
Java program that implements a brute force algorithm to find the maximum subarray.
Time complexity: O(n^2)time
*/

import java.util.Scanner;

public class MaximumSubarray
{
public static int maxsubarray(int[] inputArray)
{
int size = inputArray.length;
int maximum = Integer.MIN_VALUE;
for (int i = 0; i < size; i++)
{
int total = 0;
for (int j = i; j < size; j++)
{
total += inputArray[j];
if (total > maximum)
maximum = total;
}
}
return maximum;
}

public static void main(String[] args)
{
Scanner input = new Scanner(System.in);

System.out.print(\"Enter size of array: \");
int size = input.nextInt();
  
int[] array = new int[ size ];

for (int i = 0; i < size; i++)
{
System.out.print(\"Enter element \" + (i+1) + \": \");
array[i] = input.nextInt();
}

System.out.println(\"\ Max sub Array sum: \"+ maxsubarray(array));
}
  
}

/*
output:

Enter size of array: 8
Enter element 1: -2
Enter element 2: -5
Enter element 3: 6
Enter element 4: -2
Enter element 5: -3
Enter element 6: 1
Enter element 7: 5
Enter element 8: 6

Max sub array sum = 13

*/