<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Simple In-Place Algorithm for In-Shuffle · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/0805.1598/</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/0805.1598/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Simple In-Place Algorithm for In-Shuffle — mentioned by duped</title><link>https://news.ycombinator.com/item?id=30599151</link><guid isPermaLink="false">urn:hackerpapers:mention:0805.1598:30599151</guid><pubDate>Tue, 08 Mar 2022 12:29:38 GMT</pubDate><description>&lt;p&gt;If the arrays are in one contiguous block, I think this is equivalent to a 2-way shuffle in place, here&amp;#x27;s a neat paper on it: https://arxiv.org/pdf/0805.1598.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/0805.1598/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
