This is a fast sorting algorithm, although there's so much junk in the scripting 'cos of all the experimenting I was doing, so it's ended up rather messy - hence the name! :) It can sort both integers and decimals, with a large range. Set the sliders for the min/max and number of items, then click green flag to fill the list again. Then click SORT. Its core is a binary splitter, which recursively splits the list in two, but doesn't *move* any values around, only adding into other lists, with another couple of lists keeping track of indexing. It also keeps track of the average for each split, and uses that to split it at the next level. Once a split reaches a certain minimum 'bin' size, it puts it into a 'ready' list, and once there is nothing left to split, it sorts each chunk of 'ready' list using other methods that don't require so much index book-keeping.
