Computer Science, asked by sudheerks3106, 10 months ago

You have an array of integers of size n. You have to find the sum closest to zero for any pair in that array. The array is unsorted.

Answers

Answered by Anonymous

minimum diff. ... Simple C++ program to find the pair with sum closest to a given no. ... int l = 0, r = n-1, diff = INT_MAX; ... int n = arr. length;.

Answered by Anonymous

Explanation:

find an array the array is installed closest to 20 pair

Previous Question

Next Question

Similar questions

Science, 5 months ago

2 . What is ingestion?

English, 5 months ago

2. Where do the forces store within the Earth's interior? a) nature O b) fault c) rocks O d) epicentre...

History, 5 months ago

1. Who translated the Sanskrit texts of 'Hitopdesh' in German language ?

English, 10 months ago

You, for sure, have been studying it, consciously and subconsciously, for 40 years and you may still find men unaccountable; people you know intimately can surprise you by some action of theirs which you never thought them capable of or by the discovery of some trait which exhibits a side of themselves that you never even suspected. The idea in this sentence can be best summarized as:...

Computer Science, 10 months ago

You can upgrade your operating system only if you have a 32-bit processor running at 1 ghz or faster, at least 1 gb ram, and 16 gb free hard disk space, or a 64- bit processor running at 2 ghz or faster, at least 2 gb ram, and at least 32 gb free hard disk space. Express you answer in terms of u: you can upgrade your operating system, b32: you have a 32-bit processor, b64:...

Physics, 11 months ago

what is zero uniform velocity motion...

Hindi, 11 months ago

Hindi me ghar kiraye ke liye dene pr vigyaapn taiyaar kijiye its veryy urgent pls reply fast...

English, 11 months ago

Write Letter to Teacher in the ocassion of Teacher's day.