Can be done in O(n log n) without using aux. memory. Can be done in O(n) if you use something like a hash table.
On Jun 5, 12:40 am, Rohit Saraf <rohit.kumar.sa...@gmail.com> wrote: > Inplace in O(n) seems unlikely to me. > Well you should still try! > -------------------------------------------------- > Rohit Saraf > Second Year Undergraduate, > Dept. of Computer Science and Engineering > IIT Bombayhttp://www.cse.iitb.ac.in/~rohitfeb14 -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
