Sub array using bruteforce
import java.util.*;
class subarray{
public static void printsubarray(int arr[]){
int max=Integer.MIN_VALUE;
for(int i=0;i<=arr.length;i++){
for(int j=i;j<=arr.length;j++){
int sum=0;
for(int k=i;k<j;k++){
sum=sum+arr[k];
}
if(sum>max){
max=sum;
}
}
}
System.out.println("Maximum Sum is "+max);
}
public static void main(String[] args) {
int arr[]={-2,-4,-6,-8,-10};
printsubarray(arr);
}
}
Comments
Post a Comment