Why shouldn't it use the compare method?
This way you define what makes one of your own types larger / smaller than another.
and it only sorts if you say it to do so.
Hakea: Yes you can sort arrays, if you implement a function to do so. This way it would be faster than the list would normally be in sorting at all (quicksort or any other n log n sort algorithm) as the list can't use "indexed" sort algorithms
otherwise no as array is no type in BM and so can't have the same functionality as a list.
but you can't slice a list on the other side, so ...
perhaps this is why TList has the "fromarray" and "toarray" methodes? ;)
This way you define what makes one of your own types larger / smaller than another.
and it only sorts if you say it to do so.
Hakea: Yes you can sort arrays, if you implement a function to do so. This way it would be faster than the list would normally be in sorting at all (quicksort or any other n log n sort algorithm) as the list can't use "indexed" sort algorithms
otherwise no as array is no type in BM and so can't have the same functionality as a list.
but you can't slice a list on the other side, so ...
perhaps this is why TList has the "fromarray" and "toarray" methodes? ;)