On Thu, Oct 6, 2011 at 3:30 PM, 9ight coder <9ightco...@gmail.com> wrote:

> hey ankit can u show me 1st question solution
>
> On Oct 5, 9:06 pm, Ankur Garg <ankurga...@gmail.com> wrote:
> > Implement recursive merge sort for first question(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 <9ightco...@gmail.com>
> 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).
> >
>

Please elaborate the question. It must be condition that you should not swap
elements, you have to change the link pointer.




 > > 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 algogeeks@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.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algogeeks@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.
>
>


-- 
Regards,
Rahul Patil

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@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.

Reply via email to