Type the number of elements to sort.
A weird sorting algorithm I came up with to sort Scratch numbers with linear time complexity. It basically does radix sort, but with a bunch of extra code to handle fractional and negative values. Probably quite a bit slower than standard comparison sorts like quicksort for smaller lists, but it should be much faster for very large lists. Note: Since a lot of the code involves treating the numbers as strings, values like "3.14e42" won't work. I could probably relatively easily fix this by turning those representations into pure decimal representations, but I'm too lazy to do that. Feel free to remix this and fix that yourself.
