Hi,
On Sun, Jun 12, 2011 at 06:59:50PM +0200, Frank Barknecht wrote:
Another option would be sorting with data structures, which I usually do today. Attached is an example abstraction for data structure sorting (datasort.pd). It seems to be much faster than list-quicksort from list-abs (the currently fastest sorting in there), but only sorts in ascending order.
Well, thinking about it, descending order turned out to be dead simple, as it can be realized using a different order when building the final list ("append" instead of "prepend") so attached is a new version, that I'll probably add to the [list]-abs collection as it now has all the features of the other sorting methods, is simpler and faster.
Ciao
Frank Barknecht Do You RjDj.me? _ ______footils.org__