Did not understand what u said but it is extremely straight forward Add all the arrays to the heap comparision being only from the first element. Now remove the root, take the first element of root array and reinsert the rest of the array. Just keep doin this.
To save space you might want to avoid adding the whole array and just add some reqd pointers. But the algo remains the same. -- -------------------------------------------------- Rohit Saraf Second Year Undergraduate, Dept. of Computer Science and Engineering IIT Bombay http://www.cse.iitb.ac.in/~rohitfeb14 -- 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.
