On 26 Sep, 08:43, Terry Reedy <[EMAIL PROTECTED]> wrote: > That depends on the data structure. Access to a singly-linked list is > by linear scanning from the front.
Which is one reason why mergesort i preferred over quicksort for lists. Pythons built-in sort is a variant of mergesort and should be fast for linked lists and array lists alike. -- http://mail.python.org/mailman/listinfo/python-list
