Use k way merging On Wed, Sep 15, 2010 at 3:30 PM, bittu <shashank7andr...@gmail.com> wrote:
> You are given k sorted lists with total n inputs in all the lists > devise a algorithm to merge them into one single sorted list in O(n > logk) > > > > Regard's > Shashank Mani Narayan " Don't Be Evil U Can Earn While U learn" > Computer Science & Engineering > Birla Institute of Technology,Mesra > Cell No. +91-9166674831 > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
