Implement recursive merge sort for first question For second just swap the values of node and node b
On Wed, Oct 5, 2011 at 9:18 PM, 9ight coder <[email protected]> wrote: > 1.perform inplace(we cant create new node)merge sort of two sorted > linked list.(asked in amazon 1 mon before) > 2.a->b->c->d->e convert to b->a->d->c->e without creating new node. > (asked in microsoft on 4rth oct at thapar). > > sugeest solutions.???????? > > -- > 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. > > -- 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.
