GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — java-basics/java-programs/PairSum.java at master · learning-zone/java-basics

Expand file tree

/

PairSum.java

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
30 lines (26 loc) · 705 Bytes
/

PairSum.java

Copy path

File metadata and controls

30 lines (26 loc) · 705 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
package misc;
public class PairSum {
public static void PairWithMinSum(int arr[]) {
if (arr.length < 2) {
return;
}
int minimumSum = arr[0] + arr[1];
int pair1stIndex = 0;
int pair2ndIndex = 1;
for (int i = 0; i < arr.length; i++) {
for (int j = i + 1; j < arr.length; j++) {
int tempSum = arr[i] + arr[j];
if (Math.abs(tempSum) < Math.abs(minimumSum)) {
pair1stIndex = i;
pair2ndIndex = j;
minimumSum = tempSum;
}
}
}
System.out.println("The pair whose sum is closet to Zero: " + arr[pair1stIndex] + " & " + arr[pair2ndIndex]);
}
public static void main(String[] args) {
int[] arr = { 1, 3, -5, 7, 8, 20, -40, 6 };
PairWithMinSum(arr);
}
}
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.