Two Sum

Problem

Given a set of N integers, find all sets of two elements in the array that sum to a given integer S.

Solution

Solution is of \( O(N \log{N}) \) time.