[algogeeks] programming pearls duplicate value

This problem is from the book programming pearls . Can anyone explain me the soln. How does he do it. Given a file containing 4,300,000,000 integers, how can you find one that appears at least twice? Binary search finds an element that occurs at least twice by recursively searching the subint

[algogeeks] programming pearls duplicate value

This problem is from the book programming pearls . Can anyone explain me the soln. How does he do it. Given a file containing 4,300,000,000 integers, how can you find one that appears at least twice? (Explain, first, why this must happen.) Binary search finds an element that occurs at least t