Description: 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.)
To Search:
File list (Check if you may need any files):
未命名1.cpp
Download