Amal wrote: > There are 2 arrays say array A and array B given whose size is 'n'. Now i > have to find the first n maximum values of a[i]+b[j] . I would like to know > O(n) or O(n logn ) solutions if some exist. > > Amal. > > ------=_Part_970_27502863.1156574260653 > Content-Type: text/html; charset=ISO-8859-1 > X-Google-AttachSize: 222 > > <br>There are 2 arrays say array A and array B given whose size is 'n'. Now i > have to find the first n maximum values of a[i]+b[j] . I would like to > know O(n) or O(n logn ) solutions if some exist.<br><br>Amal.<br> > > ------=_Part_970_27502863.1156574260653--
We find the first max a[i] and the first max b[j], then add the a[i] and b[j]. Is the method ok? --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
