Hi Jack,
On Mon, May 11, 2015 at 03:02:27PM +0200, Jack wrote:
Just make this abstraction (sorting number in one direction). It works with array objects. Seems promising compare to list-sort.
That's very cool: Using a 1000-element list created with [list-random 1e+06 1000] it's more than 3 times faster:
list-sort: 13.026 array-sort: 4.016 list-sort: 13.109 array-sort: 4.036 list-sort: 13.188 array-sort: 4.024
But what's even better: It's very simple code. Unlike the data structure implementation, this is something, one could quickly type into a subpatch.
Frank Barknecht _ ______footils.org__