Reverse Array sum problem Suppose you had two arrays A and B of length n in reverse sort order and computed the array C of length n*n by taking all possible sums of A (i) + B(j) and then you sorted array C.
Find an algorithm to reverse the process to find A and B given C and assuming you already know A(1). I can think of solution which can help us reconstruct A and B, but that requires A and B to have no element in common. Can we have a more generic solution which allows A and B to have common elements? _dufus --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
