Problem
1. Let A and B be two sequences of n integers each. Given an integer m, describe an O(n log n) -time algorithm for determining if there is an integer a in A and an integer b in B such that m = a + b.
2. Given a set of n integers, describe and analyze a fast method for finding the ...logn... integers closest to the median.