one of the worst sorting algorithms i have seen, maybe worse than bogosort. I might be wrong, but i believe the chance of a list of length x being sorted after x runs is just x! so for 10 items its like 1/3628800 what this does, is if the list is not sorted, it moves a random item to the end of the list, then checks again, etc. until sorted. even 10 items already takes millions of runs to sort.
for some unknown reason this does not work on turbowarp please tell me why, highest ive gotten to sort is 11, took 6,214,865 runs
