On the adaptiveness of Quicksort

Autor: Gabriel Moruz, Gerth Stølting Brodal, Rolf Fagerberg

Publikováno v: Aarhus University
Brodal, G S, Fagerberg, R & Moruz, G 2005, On the Adaptiveness of Quicksort . in I C Demetrescu & R Tamassia (eds), Proceeding of the 7 th Workshop on Algorithm Engineering and Experiments . Society for Industrial and Applied Mathematics, pp. 130-140, The 7 th Workshop on Algorithm Engineering and Experiments, 24/08/2010 .
Brodal, G S, Fagerberg, R & Moruz, G 2008, ' On the adaptiveness of Quicksort ', ACM Journal of Experimental Algorithmics, vol. 12 . https://doi.org/10.1145/1227161.1402294
Scopus-Elsevier
Brodal, G S, Fagerberg, R & Moruz, G 2005, On the Adaptiveness of Quicksort . in ALENEX05 . Society for Industrial and Applied Mathematics, pp. 130-140, Workshop on Algorithm Engineering and Experiments, Vancouver, B.C., Canada, 22/01/2005 .
Brodal, G S, Fagerberg, R & Moruz, G 2008, ' On the Adaptiveness of Quicksort ', Journal of Experimental Algorithmics, vol. 12 . https://doi.org/10.1145/1227161.1402294
BRICS Report Series; No 27 (2004): RS-27 On the Adaptiveness of Quicksort
BRICS Report Series; Nr. 27 (2004): RS-27 On the Adaptiveness of Quicksort
Brodal, G S, Fagerberg, R & Moruz, G 2004, ' On the Adaptiveness of Quicksort ', B R I C S Report Series, no. RS-04-27 .

Quicksort was first introduced in 1961 by Hoare. Many variants have been developed, the best of which are among the fastest generic-sorting algorithms available, as testified by the choice of Quicksort as the default sorting algorithm in most program

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::43da53e8867cba027e8779ccc78c4b81
https://doi.org/10.1145/1227161.1402294