u mean dutch algorithm ? On Sun, Aug 21, 2011 at 11:31 AM, muthu raj <[email protected]> wrote:
> Segregate the Odd and even nodes in the list by traversing in O(n). Then > print the resulting list in O(n). So no additional space required and > solution in O(n) time also :) > *Muthuraj R > IV th Year , ISE > PESIT , Bangalore* > > > > > On Fri, Aug 19, 2011 at 9:48 AM, priya ramesh < > [email protected]> wrote: > >> +1 sagar! i too have the same answer :) >> >> -- >> 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. > -- 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.
