Sub-array with worst case time complexity
import java.util.*;
class subarray{
public static void printsubarray(int arr[]){
int len=arr.length;
int z=0,max=0,min=100;
int totalsubstring=(len)*(len+1)/2;
int sum[]=new int[totalsubstring];
for(int i=0;i<=arr.length;i++){
for(int j=i+1;j<=arr.length;j++){
for(int k=i;k<j;k++){
System.out.print(arr[k]+" ");
sum[z]=sum[z]+arr[k];
max=Math.max(sum[z],max);
min=Math.min(sum[z],min);
}
System.out.print(",");
z++;
}
System.out.println();
}
System.out.println("Sum of each pair is:-");
for(int y=0;y<sum.length;y++){
System.out.print(sum[y]+" ");
}
System.out.println("maximum sum is "+max);
System.out.println("minimum sum is "+min);
}
public static void main(String[] args) {
int arr[]={2,4,6,8,10};
printsubarray(arr);
}
}
Comments
Post a Comment