C语言算法排序问题

资 源 简 介

1．Describe a Θ(n lg 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. (Implement exercise 2.3-7.)

您 可 能 感 兴 趣 的