<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>New Sorting Algorithm Wave Sort (W-Sort) · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2505.13552/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:27:26 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2505.13552/feed.xml" rel="self" type="application/rss+xml" /><item><title>New Sorting Algorithm Wave Sort (W-Sort) — HN submission</title><link>https://news.ycombinator.com/item?id=46525661</link><guid isPermaLink="false">urn:hackerpapers:submission:2505.13552:46525661</guid><pubDate>Wed, 07 Jan 2026 12:31:29 GMT</pubDate><description>&lt;p&gt;Show HN: Sorting a billion of integers in 7.6 seconds&lt;/p&gt;&lt;p&gt;This is a reproduction of paper https://arxiv.org/abs/2505.13552 where the author compares a new algorithm with QuickSort, which is approximately 24% faster&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2505.13552/"&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>
