Find the pair in array whose sum is closest to x | GeeksforGeeks

Find Complete Code at GeeksforGeeks Article: www.geeksforgeeks.org/given-so...
Similar Video: • Given an array A[] and...
This video is contributed by Parikshit Kumar Pruthi
Please Like, Comment and Share the Video among your friends.
Also, Subscribe if you haven't already! :)

[@CristianGarcia]

This double pointer technique seems to pop as solution to many problems with small variations e.g. finding the longest sub-sequence of unique elements.
Is there a general principal of when you can frame the problem as such?

[@ahishnar1568]

Ya actually needed.

[@wecan2729]

use binary search

[@NaveenKumar-ce9vq]

Can u plz provide code in c language

[@SagarAnkitaUpdates]

why are you screaming bro?

[@sabyasachi3389]

True Don't know why he screaming. It can be explained in must easier fashion.

[@terasoft1321]

its like reading something loudly :)

[@ambujk1]

Fix the video - the most basic fact in "Efficient Solution" is missing that the array must be sorted.

[@GeeksforGeeksVideos]

Well, the problem statement itself says, "Given a sorted array..."

[@masbro1901]

its not working when number x is in the array
ex:
int arr[] = { 10, 20, 5, 4, 2, 1 }, x = 10;
it gives 10 and 1, it should 5 and 4

[@rupampaul]

The array should be sorted first!! Read the problem statement

[@ahishnar1568]

@@rupampaul Exactly

[@ketanjoshi4568]

Thanks for the solution. If you are sorting the array then sorting dominates the complexity , so wont that be O(n log n)

[@elvinjafarli6257]

Open your eyes and see the initial slide, it says given already sorted array

[@AvgTuber]

lets say u did merge sort...then it is O(n Log n), still the same.

[@AvgTuber]

anyway watch my videos :)

[@sudhamshbolisetty01]

please can you provide the code in R language

[@Itshristi]

what is r language

[@elvinjafarli6257]

@@Itshristi used for data scientists, statisticians

[@abhaygupta2946]

Pl