Quicksort, dual Quicksort a multi-pivot Quicksort: kdo je nejrychlejší? – Bc. Lukáš Korenčik
Bc. Lukáš Korenčik
Bachelor's thesis
Quicksort, dual Quicksort a multi-pivot Quicksort: kdo je nejrychlejší?
Comparison of Quicksort, Dual Quicksort, and Multi-pivot Quicksort
Abstract:
This bachelor thesis experimentally compares variants of algorithm quicksort, which are using more pivots. First part offers theoretical description, second is dedicated to experiments and their evaluation.Abstract:
Táto bakalárska práca experimentálne porovnáva varianty algoritmu quicksort, ktoré používajú viac pivotov. Prvá časť ponúka teoretický popis, druhá sa venuje experimentom a ich vyhodnoteniu.
Language used: Slovak
Date on which the thesis was submitted / produced: 26. 5. 2017
Identifier:
https://is.muni.cz/th/sy8my/
Thesis defence
- Date of defence: 26. 6. 2017
- Supervisor: prof. RNDr. Ivana Černá, CSc.
- Reader: RNDr. Nikola Beneš, Ph.D.
Citation record
Full text of thesis
Contents of on-line thesis archive
Published in Theses:- světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatikyMasaryk University
Faculty of InformaticsBachelor programme / field:
Applied Informatics / Applied Informatics