You first find the greatest N values for each array.(No need for it here, because both arrays are of size N) The first pair will be both maximums(or maxima, actually, in greek). then, in a way of Merge(Nonincreasing order), we pick the next pairs.
--~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
