Find Max Sub Array Sum in Java(Brute - Force Algorithm).

package brute_force;

import java.util.Scanner;

public class Brute_Force {

 

 

    public static void main(String[] args)

    {

       Scanner sc = new Scanner(System.in);

       int max=-999999;

       int n;

       System.out.println("Enter Array Size: ");

       n = sc.nextInt();

       int array[] = new int[n];

     

        System.out.println("Enter Array Element: ");

        for(int i=0;i<n;i++)

        {

            array[i]= sc.nextInt();

        }

     

       for(int i=0;i<n;i++)

       {

           int sum=0;

           for(int j=i;j<n;j++)

           {

              sum+=array[j];

              if(max<sum)

              {

                  max=sum;

              }

           }                      

       }

        System.out.println("Max Sub Array Sum: "+max);

     

    }

 

}