Faster deterministic sorting through better sampling

Jop F. Sibeyn
2003 Theoretical Computer Science  
In this paper, a reÿned deterministic sampling strategy is presented. It allows to improve the performance of deterministic sample-sort algorithms to the point that they can compete with their randomized counterparts. The method is illustrated by a detailed analysis for the cases of sorting on meshes and for sorting in external memory on a single processor machine.
doi:10.1016/s0304-3975(02)00321-3 fatcat:2rfn4jbj2zdznl6xoqpax6yakq