maximum sum of array

1. Experiment Number:01
Maximum Sum Of Sub Array
1
ROLL NUMBER:22125A3109
SOURCE_CODE:
import java.util.*;
class MaxSubArr
{
public static int sumRange(int arr[], int start, int end)
{
int sum = 0;
for(int i = start; i <= end; i++)
{
sum += arr[i];
}
return sum;
}
public static int[] returnSubArr(int arr[], int start, int end)
{
int subArr[] = new int[end - start + 1];
int ind = 0;
for(int i = start; i <= end; i++)
{
subArr[ind] = arr[i];
ind++;
}
return subArr;
}
public static void printArr(int arr[])
{
for(int i = 0; i < arr.length; i++)
{
System.out.print(arr[i] + " ");

2. 2
ROLL NUMBER:22125A3109
}
}
public static void maxSubArr(int arr[])
{
int size = arr.length;
int maxSum = Integer.MIN_VALUE;
int subArr[] = new int[0];
for(int start = 0; start < size; start++){
for(int end = start; end < size; end++){
int curSum = sumRange(arr, start, end);
if(curSum > maxSum){
maxSum = curSum;
subArr = returnSubArr(arr, start, end);
}
}
}
System.out.println("Maximum sum subArray: ");
printArr(subArr);
System.out.print("nMaximum sum of the sub array: " + maxSum);
}
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.print("Enter size of the array: ");
int size = sc.nextInt();
System.out.print("Enter any " + size + " elements into the array: ");
int arr[] = new int[size];
for(int i = 0; i < size; i++){
arr[i] = sc.nextInt();
}
maxSubArr(arr);

3. 3
ROLL NUMBER:22125A3109
}
}
OUTPUT:
Enter size of the array: 6
Enter any 6 elements into the array: 1 -3 2 6 -2 5
Maximum sum of subArray:
2 6 -2 5
Maximum sum of the sub array: 11