FilesExpand file tree

 master

/

sum_of_pair_equals_array_element.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

43 lines (38 loc) · 866 Bytes

 master

/

sum_of_pair_equals_array_element.java

Copy path

Top

File metadata and controls

• Code
• Blame

43 lines (38 loc) · 866 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

31

32

33

34

35

36

37

38

39

40

41

42

43

//algo : O(nlog)+O(n2)=O(n2)

/* package whatever; // don't place package name! */

import java.util.*;

import java.lang.*;

import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */

class Ideone

{

public static void main (String[] args) throws java.lang.Exception

{

Scanner sc=new Scanner(System.in);

int n=sc.nextInt();

int []arr=new int[n];

for(int i=0;i<n;i++)

arr[i]=sc.nextInt();

Arrays.sort(arr);

boolean flag=false;

for(int i=0;i<n;i++)

{

int low=0, high=n-1;

while(low<high)

{

if(arr[low]+arr[high]==arr[i])

{

System.out.println("pairs found for : "+arr[i]+"="+arr[low]+"+"+arr[high]);

flag=true;

break;

}

else if(arr[low]+arr[high]<arr[i])

low++;

else

high--;

}

}

if(flag==false)

System.out.println("no pair exists");

}

}