But perhaps the elements in lists may not be in order. Anurag Sharma http://anuragsharma-sun.blogspot.com/
On Thu, Jun 3, 2010 at 6:38 PM, Rohit Saraf <[email protected]>wrote: > simple in place O(n lg n) solution. > Choose a pivot in first array and partition it like in quicksort. > Find the pivot in second array and partition. Now recurse on both > halves. At any point if no of elements in array are not equal... > Abort! > > > -- > -------------------------------------------------- > Rohit Saraf > Second Year Undergraduate, > Dept. of Computer Science and Engineering > IIT Bombay > http://www.cse.iitb.ac.in/~rohitfeb14<http://www.cse.iitb.ac.in/%7Erohitfeb14> > > -- > 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.
