Divide and Conquer approach works. Look up merge sort. I don't know how "the most" efficient way. Actually I'm not sure if there are many ways to do this. It will take O(n) time either way (unless there are other specifics given which we can make use of).
On Jun 8, 7:29 am, Raj N <rajn...@gmail.com> 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 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.
