Set the number of items in the list and click the green flag. This will generate a random list of numbers from 0-984343 of the set size and will determine the time taken to sort each.
I made this to try to find a faster sorting algorithm to use for Triengine, but the current one I'm using (Insertion) is actually the fastest under 75 items. For anything above, quicksort wins by a long shot, with merge sort close behind. Surprisingly, the unrolled quicksort is occasionally slower than the normal quicksort. The unrolled quicksort basically avoids using extra functions by making the sort a complete mess.
