Given a list of numbers, A = {a0, a1, ..., an-1}, its pairwise sums P
are defined to be all numbers of the form ai + aj for 0 <= i < j < n.
For example, if A = {1,2,3,4}, then
P = {1+2, 1+3, 1+4, 2+3, 2+4, 3+4} = {3, 4, 5, 5, 6, 7}.
Now give you P, design an algorithm to find all possible A.-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
