1. Take single element from each list . Put it in array maintaining min heap property , 2. Copy the lowest element ( O(1) ) from the heap to the single sorted list thand delete the element from heap. 3. Insert a new element into the heap ( O(logk) ) from list belonging to the deleted element . 4. repeat 2 and 3 till all list are empty.
Regards Rahul Singal 3rd yr , Computer Science Department Birla Institute of technology and Science , Pilani -- 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.
