some guide

describe a theta (nlog n)-time algorithm that give a set of S of n
integers
and another integer x determine whether or not there exit two elements
in s whose sum is exactly x

.