The titles of the other projects reminded me of the paper "Is this the simplest (and most surprising) sorting algorithm ever?" https://arxiv.org/abs/2110.01111 This one sorts by swapping items, so I have it work on `out` and leave `list` as reference Also, it turns out that @abee implemented this algorithm a while ago: https://scratch.mit.edu/projects/581975616/ Our code is almost identical, except this one uses for each blocks and doesn't separate swap into a custom block
