green flag to empty the list, add 2 random values, and start sorting forever space to append a random value
in the leftmost case of a>b, move b to the start. That's the whole algorithm. It's really slow if the last element is large, but the values will eventually be sorted. It might be faster if I modify it to move a to the end in the rightmost case of a>b. 12/14/25: adding an item after stopping the project will now cause the list to start sorting again.
