ashish wrote:

> If you have memory to spare, then you can just copy the linked list to
> an array and just do mergesort/radixsort etc. to get O(n logn) time
> complexity.

You don't need the extra memory - the beauty of mergesort
on linked lists is that it can be done in-place, stably, and
in O(n log n) time.


--~--~---------~--~----~------------~-------~--~----~
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 [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---

Reply via email to