<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Is this the simplest (and most surprising) sorting algorithm ever? · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2110.01111/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2110.01111/feed.xml" rel="self" type="application/rss+xml" /><item><title>Is this the simplest (and most surprising) sorting algorithm ever? — HN submission</title><link>https://news.ycombinator.com/item?id=49537867</link><guid isPermaLink="false">urn:hackerpapers:submission:2110.01111:49537867</guid><pubDate>Wed, 02 Sep 2026 15:34:25 GMT</pubDate><description>&lt;p&gt;Is this the simplest (and most surprising) sorting algorithm?&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;3 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2110.01111/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Is this the simplest (and most surprising) sorting algorithm ever? — HN submission</title><link>https://news.ycombinator.com/item?id=49526155</link><guid isPermaLink="false">urn:hackerpapers:submission:2110.01111:49526155</guid><pubDate>Tue, 01 Sep 2026 18:40:18 GMT</pubDate><description>&lt;p&gt;Is this the simplest/ most surprising sorting algorithm ever (2021)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2110.01111/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Is this the simplest (and most surprising) sorting algorithm ever? — HN submission</title><link>https://news.ycombinator.com/item?id=43155839</link><guid isPermaLink="false">urn:hackerpapers:submission:2110.01111:43155839</guid><pubDate>Mon, 24 Feb 2025 04:26:22 GMT</pubDate><description>&lt;p&gt;Is this the simplest (and most surprising) sorting algorithm ever? (2021)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;130 points; 118 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2110.01111/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Is this the simplest (and most surprising) sorting algorithm ever? — HN submission</title><link>https://news.ycombinator.com/item?id=42738793</link><guid isPermaLink="false">urn:hackerpapers:submission:2110.01111:42738793</guid><pubDate>Fri, 17 Jan 2025 15:42:02 GMT</pubDate><description>&lt;p&gt;Is this the simplest (and most surprising) sorting algorithm?&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2110.01111/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Is this the simplest (and most surprising) sorting algorithm ever? — HN submission</title><link>https://news.ycombinator.com/item?id=34980125</link><guid isPermaLink="false">urn:hackerpapers:submission:2110.01111:34980125</guid><pubDate>Wed, 01 Mar 2023 08:42:06 GMT</pubDate><description>&lt;p&gt;The “I can&amp;#x27;t believe it can sort” algorithm&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2110.01111/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Is this the simplest (and most surprising) sorting algorithm ever? — mentioned by btown</title><link>https://news.ycombinator.com/item?id=33414262</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.01111:33414262</guid><pubDate>Mon, 31 Oct 2022 22:33:23 GMT</pubDate><description>&lt;p&gt;ICantBelieveItCanSort: https://arxiv.org/pdf/2110.01111.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.01111/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Is this the simplest (and most surprising) sorting algorithm ever? — mentioned by justusthane</title><link>https://news.ycombinator.com/item?id=31976828</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.01111:31976828</guid><pubDate>Mon, 04 Jul 2022 13:31:41 GMT</pubDate><description>&lt;p&gt;Nope - here&amp;#x27;s the original paper on the algorithm in question: https://arxiv.org/pdf/2110.01111.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.01111/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Is this the simplest (and most surprising) sorting algorithm ever? — mentioned by palotasb</title><link>https://news.ycombinator.com/item?id=31976829</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.01111:31976829</guid><pubDate>Mon, 04 Jul 2022 13:31:41 GMT</pubDate><description>&lt;p&gt;No, it&amp;#x27;s not. Previously discussed on HN here: https://news.ycombinator.com/item?id=28758106 (https://arxiv.org/abs/2110.01111)&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.01111/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Is this the simplest (and most surprising) sorting algorithm ever? — mentioned by fargle</title><link>https://news.ycombinator.com/item?id=31306021</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.01111:31306021</guid><pubDate>Sun, 08 May 2022 17:19:56 GMT</pubDate><description>&lt;p&gt;post the source, not the twit about it: https://arxiv.org/pdf/2110.01111.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.01111/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Is this the simplest (and most surprising) sorting algorithm ever? — mentioned by areyousure</title><link>https://news.ycombinator.com/item?id=28760986</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.01111:28760986</guid><pubDate>Tue, 05 Oct 2021 15:42:16 GMT</pubDate><description>&lt;p&gt;Some links to discussions and/or accidental discoveries of this algorithm: OP (2021): https://arxiv.org/abs/2110.01111 Stack Overflow (2021, linked by &amp;#x27;Xophmeister in this discussion): https://stackoverflow.com/questions/69437526/what-is-this-od... Stack Overflow (2021, linked from previous): https://stackoverflow.com/revisions/69435932/1 Stack Overflow with 5 downvotes! (2020): https://stackoverflow.com/questions/63214115/what-is-the-nam... Stack Overflow (2020): https://stackoverflow.com/questions/59802669/pointer-array-s... Computer Science Stack Exchange (2015, linked by &amp;#x27;GistNoesis in…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.01111/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Is this the simplest (and most surprising) sorting algorithm ever? — mentioned by jakub_g</title><link>https://news.ycombinator.com/item?id=28759207</link><guid isPermaLink="false">urn:hackerpapers:mention:2110.01111:28759207</guid><pubDate>Tue, 05 Oct 2021 13:32:42 GMT</pubDate><description>&lt;p&gt;HTML version of the PDF: https://www.arxiv-vanity.com/papers/2110.01111/&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2110.01111/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>Is this the simplest (and most surprising) sorting algorithm ever? — HN submission</title><link>https://news.ycombinator.com/item?id=28758106</link><guid isPermaLink="false">urn:hackerpapers:submission:2110.01111:28758106</guid><pubDate>Tue, 05 Oct 2021 11:49:16 GMT</pubDate><description>&lt;p&gt;Is this the simplest (and most surprising) sorting algorithm?&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;621 points; 318 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2110.01111/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
