Been done before. Check the archives On Sat, Sep 10, 2011 at 12:15 AM, aditya kumar <[email protected] > wrote:
> Given k sorted streams where each stream could possibly be infinite in > length, describe an efficient algorithm to merge the k streams into a new > stream (also in sorted order). > > -- > 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?hl=en. > -- Anup Ghatage -- 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?hl=en.
