Engineering In-place (Shared-memory) Sorting Algorithms · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/2009.13569/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTEngineering In-place (Shared-memory) Sorting Algorithms — mentioned by scott_shttps://news.ycombinator.com/item?id=28220758urn:hackerpapers:mention:2009.13569:28220758Wed, 18 Aug 2021 13:36:48 GMT<p>Academic paper: &quot;Engineering In-place (Shared-memory) Sorting Algorithms&quot;, Michael Axtmann, Sascha Witt, Daniel Ferizovic, Peter Sanders, https://arxiv.org/abs/2009.13569 To start discussion, I think it&#x27;s interesting to note how I landed on this repo and paper. I got curious about Tim Sort, and some searching on HN brought up a 2018 story, &quot;On the Worst-Case Complexity of TimSort&quot;, https://news.ycombinator.com/item?id=17883461. In the comments, poster lorenzhs has an excellent comment (https://news.ycombinator.com/item?id=17884612) which points out IPS4o as a sorting algorithm that takes…</p><p><a href="https://hackerpaper.kaipfister.de/p/2009.13569/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DC