Does anyone know what specific algorithm the array.sort uses?
The internet tells me these are the methods that exist.
Bubble
insertion
selection
shell
heap
merge
quick
So which might it be?
From a peek at the source I'd say quick sort.
The array sort function seems to be quick sort, the linked list function seems to use something else.
That's good. The overhead inherent with quicksort isn't a real problem then?
TList seems to use the good ol' bubble sort. If you're intrested in sorting algorithms there's a [url=http://www.codersworkshop.com/viewshowcase.php?id=28] showcase enrty [/url] over at coders workshop that demonstrates some examples.