There is a well-known bound for the comparison sort, O(nlogn). If there is a way to sort doubly-linked list in a linear time, so we are able to sort all sequencies in this time. But it is impossible!
-- 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.
