Add detail

Problem 2.3-7 of cormen

Describe a nlgn -time algorithm that, given a set S of n integers and another
integer x, determines whether or not there exist two elements in S whose sum is
exactly x.