scientific article; zbMATH DE number 7359768
From MaRDI portal
Publication:4993558
Recommendations
- Average case and distributional analysis of dual-pivot quicksort
- QuickXsort: efficient sorting with n n - 1.399n + o(n) comparisons on average
- Transitional behaviors of the average cost of quicksort with median-of-\((2t+1)\)
- Optimal sampling strategies for quicksort
- Efficient sample sort and the average case analysis of PEsort
- Quicksort asymptotics
- Optimal sampling strategies in Quicksort and Quickselect
- The number of bit comparisons used by quicksort: an average-case analysis
- DUAL PIVOT QUICKSORT
Cites work
- A Tournament Problem
- An average case analysis of Floyd's algorithm to construct heaps
- Asymptotic expansions of the mergesort recurrences
- Bottom-up mergesort -- A detailed analysis
- scientific article; zbMATH DE number 1629853 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 909705 (Why is no real title available?)
- scientific article; zbMATH DE number 1444318 (Why is no real title available?)
- Improved master theorems for divide-and-conquer recurrences
- In-place sorting
- Mellin transforms and asymptotics. The mergesort recurrence
- Optimal sampling strategies in Quicksort and Quickselect
- QuickHeapsort, an efficient mix of classical sorting algorithms
- QuickXsort: efficient sorting with n n - 1.399n + o(n) comparisons on average
Cited in
(3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993558)
