Quick sort implementation in python
sturlamolden at yahoo.no
Fri Sep 26 22:24:01 CEST 2008
On 26 Sep, 08:43, Terry Reedy <tjre... at udel.edu> 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.
More information about the Python-list