Partial Quicksort and Quickpartitionsort

MaRDI QIDQ2959928zbMATH OpenFDO

Authors Conrado Martínez, Uwe Rösler

Publication date 10 February 2017

Full work available at URL http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAM0135

zbMATH Keywords

asymptotic distributioncontraction methoddivide and conquer algorithmFindoptimal adapted algorithmsQuicksortrandom algorithmrunning time analysissearchingsortingstochastic fixed-point equation

Mathematics Subject Classification ID

Searching and sorting (68P10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 5556016
• On quickselect, partial sorting and multiple Quickselect
• Almost sure convergence to the quicksort process
• Exploiting partial order with Quicksort
• Combinatorial analysis of quicksort algorithm

Cited in

(7)

• Almost sure convergence to the quicksort process
• The quicksort process
• DUAL PIVOT QUICKSORT
• Exploiting partial order with Quicksort
• scientific article; zbMATH DE number 5556016 (Why is no real title available?)
• All solutions of the stochastic fixed point equation of the Quicksort process
• On quickselect, partial sorting and multiple Quickselect

This page was built for publication: Partial Quicksort and Quickpartitionsort

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959928)