7. (15分) Describe an O(nlog n)-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.
阿摩線上測驗
登入
阿摩線上測驗
登入
7. (15分) Describe an O(nlog n)-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.