arXiv:2110.01111cs.DS
We present an extremely simple sorting algorithm. It may look like it is obviously wrong, but we prove that it is in fact correct. We compare it with other simple sorting algorithms, and analyse some of its curious properties.
Linked by 6 identifiable commenters in 6 comments across 4 threads, from Oct 2021 to Oct 2022. Found in 6 HN submissions from Oct 2021 to Sep 2026. Open submission discussions.
Nope - here's the original paper on the algorithm in question: https://arxiv.org/pdf/2110.01111.pdf
No, it's not. Previously discussed on HN here: https://news.ycombinator.com/item?id=28758106 (https://arxiv.org/abs/2110.01111)
post the source, not the twit about it: https://arxiv.org/pdf/2110.01111.pdf
HTML version of the PDF: https://www.arxiv-vanity.com/papers/2110.01111/
Some links to discussions and/or accidental discoveries of this algorithm: OP (2021): https://arxiv.org/abs/2110.01111 Stack Overflow (2021, linked by 'Xophmeister in this discussion): https://stackoverflow.com/questions/69437526/what-is-this-od... Stack Overflow (2021, linked…
Connected through shared HN threads, not inferred similarity or a recommendation.
ICantBelieveItCanSort: https://arxiv.org/pdf/2110.01111.pdf
btownView on HNParent context