Perform simple merging taking the ends of the list. So You compare the last elements of both the list which ever is larger you copy that at the end of the first array and so on. you got to maintain three pointer , two for the lists and the third one for the position it should be placed. time complexity will be O(m+n)
On Wed, Dec 29, 2010 at 2:55 PM, monty 1987 <[email protected]> wrote: > hi , > this is not a research kind of problem i expect a simple answer. > > > On Wed, Dec 29, 2010 at 2:33 PM, juver++ <[email protected]> wrote: > >> Use inplace merge algorithms along with merge sort. >> http://www.logiccoder.com/Downloads/krnrd20.pdf >> >> -- >> 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.
