Find a Pair Whose Sum is Closest to zero in Array

Golu Rawat answered on August 24, 2022 Popularity 6/10 Helpfulness 4/10

answer Find a Pair Whose Sum is Closest to zero in Array

Find a Pair Whose Sum is Closest to zero in Array

Comment

// Java code to find Two elements
// whose sum is closest to zero
import java.util.*;
import java.lang.*;
class Main
{
    static void minAbsSumPair(int arr[], int arr_size)
    {
      int inv_count = 0;
      int l, r, min_sum, sum, min_l, min_r;
      
      /* Array should have at least two elements*/
      if(arr_size < 2)
      {
        System.out.println("Invalid Input");
        return;
      }
      
      /* Initialization of values */
      min_l = 0;
      min_r = 1;
      min_sum = arr[0] + arr[1];
      
      for(l = 0; l < arr_size - 1; l++)
      {
        for(r = l+1; r < arr_size; r++)
        {
          sum = arr[l] + arr[r];
          if(Math.abs(min_sum) > Math.abs(sum))
          {
            min_sum = sum;
            min_l = l;
            min_r = r;
          }
        }
      }
      
      System.out.println(" The two elements whose "+
                              "sum is minimum are "+
                        arr[min_l]+ " and "+arr[min_r]);
    }
     
    // main function
    public static void main (String[] args)
    {
        int arr[] = {1, 60, -10, 70, -80, 85};
        minAbsSumPair(arr, 6);
    }
     
}

Popularity 6/10 Helpfulness 4/10 Language whatever

Source: www.geeksforgeeks.org

Tags: closest find sum whatever zero

Link to this answer
Share Copy Link

Contributed on Aug 24 2022

Golu Rawat

0 Answers Avg Quality 2/10

Find a Pair Whose Sum is Closest to zero in Array

Contents

More Related Answers

Find a Pair Whose Sum is Closest to zero in Array

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.