Optimal Partitioning for Dual-Pivot Quicksort · HackerPapers discussions

Optimal Partitioning for Dual-Pivot Quicksort — mentioned by thomasahle

Wed, 11 Oct 2017 19:26:34 GMT

Your article [1] isn't a real published article, and it doesn't have a proper analysis. For somebody who has actually done the work, and gotten it published, see https://arxiv.org/pdf/1303.5217.pdf

Paper and discussion history. A mention is not an endorsement.

Optimal Partitioning for Dual-Pivot Quicksort — mentioned by ballard

Thu, 01 Aug 2013 04:25:44 GMT

I don't know what happened, but I got to level 21 somehow. :) This is cool and handy for lecturers explaining sorting/searching. In practice: merge, insertion and dual pivot [1] /single pivot quick(er)sort [2] are the usual tools in the toolbox, that like everything, depend on the specific use. Oh, and radix sort for rainbow tables. On DPQS, there's apparently a method for 1.8n ln n + O(n) [3] References: 1. http://www.iaroslavski.narod.ru/quicksort/DualPivotQuicksort.pdf 2. The FlashSort Algorithm http://www.neubert.net/FSOIntro.html 3. Optimal Partitioning for Dual Pivot Quicksort…

Paper and discussion history. A mention is not an endorsement.

Optimal Partitioning for Dual-Pivot Quicksort — HN submission

Mon, 25 Mar 2013 14:52:37 GMT

Dual Pivot Quicksort (better expected constants) [pdf]

1 point; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.