Again, my implementation is just terrible, and not this slow in reality
Note: this is actually faster than the insertion sort algorithm I made a while back (obviously), the only reason it looks slower is because drawing the list is really... REALLY slow, and since this algorithm makes more chances and therefore draws more, it has a longer time
