@all i got a sol this from my friend ..
Sort chunks of 1Million numbers. There will be 10^6 (1-million) set of 1 million numbers in 1 trillion numbers. Now initialize a min-heap of size 1 million with first element of each set. Keep removing the minimum element (1 million times) and replacing it by the next element of the corresponding array. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
