But what if the same same problem is extended for multiple lists. As the individual lists have already been sorted, is there any efficient way or any other sorting algo which exploits this fact.
On Tue, Jun 8, 2010 at 10:56 PM, divya jain <[email protected]>wrote: > merging as in merge sort. > > On 8 June 2010 19:59, Raj N <[email protected]> wrote: > >> What is the most efficient way of combining 2 separate ordered list >> into a single ordered list ? >> >> -- >> 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]<algogeeks%[email protected]> >> . >> 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 [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > 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 [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.
