Probabilistic analysis of dual-pivot quicksort "Count"
- 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.
| Author: | Jasmin StraubGND |
|---|---|
| URN: | urn:nbn:de:hebis:30:3-444927 |
| Place of publication: | Frankfurt am Main |
| Referee: | Ralph NeiningerORCiDGND, Götz KerstingGND |
| Document Type: | Master's Thesis |
| Language: | English |
| Date of Publication (online): | 2017/09/06 |
| Year of first Publication: | 2017 |
| Publishing Institution: | Universitätsbibliothek Johann Christian Senckenberg |
| Granting Institution: | Johann Wolfgang Goethe-Universität |
| Date of final exam: | 2017/07/26 |
| Release Date: | 2017/09/07 |
| Page Number: | 52 |
| HeBIS-PPN: | 41630124X |
| Institutes: | Informatik und Mathematik |
| Dewey Decimal Classification: | 5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik |
| Sammlungen: | Universitätspublikationen |
| Licence (German): |  Deutsches Urheberrecht |
