TY  - THES
A1  - Straub, Jasmin
T1  - Probabilistic analysis of dual-pivot quicksort "Count"
N2  - Recently, Aumüller and Dietzfelbinger proposed a version of a dual-pivot Quicksort, called "Count", which is optimal among dual-pivot versions with respect to the average number of key comparisons required. In this master's thesis we provide further probabilistic analysis of "Count". We derive an exact formula for the average number of swaps needed by "Count" as well as an asymptotic formula for the variance of the number of swaps and a limit law. Also for the number of key comparisons the asymptotic variance and a limit law are identified. We also consider both complexity measures jointly and find their asymptotic correlation.
Y1  - 2017
UR  - http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/44492
UR  - https://nbn-resolving.org/urn:nbn:de:hebis:30:3-444927
CY  - Frankfurt am Main
ER  -