This method repeatedly scans left to right and reverses descending runs, whereas bubble sort only reverses runs of 2.
If anyone knows the time complexity or the existing name of this sort, please comment. My guess is O(n^2) comparisons, and technically no swaps. 10/2/26: added fast render. Will render after every reversal if set to 0, otherwise every pass. That's O(n^2) renders when off, O(n) when on.
