[ermir]

Isn't the sorting algorithm in question the famous BubbleSort? I understand the value of formally proving it works, but why is the name mentioned nowhere?

[smcl]

It feels similar at first blush but it's not really. In bubble sort you compare/swap adjacent elements, and exit if you make a pass through the collection without making any changes. Whereas this will compare/swap the element at every index to every other index, and just exits when it's done performing all those comparisons.

[palotasb]

No, it's not. Previously discussed on HN here: https://news.ycombinator.com/item?id=28758106 (https://arxiv.org/abs/2110.01111)

[justusthane]

Nope - here's the original paper on the algorithm in question: https://arxiv.org/pdf/2110.01111.pdf

[ufo]

It's actually closer to insertion sort.