<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A numerical analysis of Quicksort: How many cases are bad cases? · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1507.04220/</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/1507.04220/feed.xml" rel="self" type="application/rss+xml" /><item><title>A numerical analysis of Quicksort: How many cases are bad cases? — mentioned by coherentpony</title><link>https://news.ycombinator.com/item?id=10136059</link><guid isPermaLink="false">urn:hackerpapers:mention:1507.04220:10136059</guid><pubDate>Fri, 28 Aug 2015 15:43:36 GMT</pubDate><description>&lt;p&gt;If you&amp;#x27;re going to post articles from arxiv, please post the top-level description so I can read the abstract before being forced to download a PDF document. http://arxiv.org/abs/1507.04220&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1507.04220/"&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>A numerical analysis of Quicksort: How many cases are bad cases? — HN submission</title><link>https://news.ycombinator.com/item?id=10134216</link><guid isPermaLink="false">urn:hackerpapers:submission:1507.04220:10134216</guid><pubDate>Fri, 28 Aug 2015 08:03:37 GMT</pubDate><description>&lt;p&gt;A numerical analysis of Quicksort: How many cases are bad cases? [pdf]&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;35 points; 10 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1507.04220/"&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>
