Efficient sample sort and the average case analysis of PEsort

DOI10.1016/j.tcs.2006.07.017zbMath1110.68030OpenAlexW1994231138MaRDI QIDQ861251

Jing-Chao Chen

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.017

zbMATH Keywords

sortingquicksortcomplexity of algorithmsmaster theoremproportion extend sortsamplesort

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10)

Uses Software

• Quicksort

Cites Work

• Unnamed Item
• Unnamed Item
• An experimental analysis of parallel sorting algorithms
• A framework for adaptive sorting
• Proportion Extend Sort
• Optimal Sampling Strategies in Quicksort and Quickselect
• Improved master theorems for divide-and-conquer recurrences
• Algorithms – ESA 2004
• Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
• Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
• Quicksort

This page was built for publication: Efficient sample sort and the average case analysis of PEsort