Finding two elements in a given array whose sum is minimum

 public class MinimumSum{

public static void calculateSum(int arr[]){

int minSum = arr[0]+arr[1];

int sum =0;

int i,j;

int minFirst=0;

int minSecond=1;

for(i=0; i<arr.length-1;i++){

for(j=i+1;j<arr.length;j++){

sum = arr[i]+arr[j];

if(Math.abs(minSum)>Math.abs(sum)){

minSum=sum;

minFirst = i;

minSecond = j;

}

}

}

System.out.println("Two elements whose sum is minimum are :");

System.out.println(arr[minFirst]+" "+"and"+" "+ arr[minSecond]);

}

public static void main(String args[]){

int arr [] ={1,2,3,-7,4,-2,5,-1};

int arr2 [] ={24,22,1,-18,-8,-6,23};

calculateSum(arr);

calculateSum(arr2);

}

}