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 [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.
