Problem
Consider two sorted arrays of arbitary size, The aim is to find k minimum
sums with the condition that there must be elements from both
arrays in each sum. What is the best possible way to do this o(klogk) ?
example input
array1 = [1,2,3,4,5,6,7]
array2= [3,4,7,9,15,17,25]
find 3 smallest sums
output : [4] =[3+1]
[5]= [3+2]
[5]=[4+1]
--~--~---------~--~----~------------~-------~--~----~
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-beta.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
