TL;DR
This paper introduces a surprisingly simple sorting algorithm, proves its correctness, compares it with other simple algorithms, and explores its interesting properties.
Contribution
It presents a novel, extremely simple sorting algorithm with a formal correctness proof and analysis of its unique properties.
Findings
Proves the correctness of the simple sorting algorithm.
Shows the algorithm's performance relative to other simple sorts.
Identifies interesting properties that distinguish it from traditional algorithms.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
