Increasing the efficiency of quicksort

DOI10.1145/362736.362753MaRDI QIDQ5595580zbMATH OpenOpenAlexFDO

Authors M. H. van Emden

Publication date 1970

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/362736.362753

zbMATH Keywords

computer science and systems

Cited in

(17)

• Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm
• The analysis of Quicksort programs
• The use of Hoare's method of program verification for the Quicksort algorithm
• Analysis of multiple quickselect variants.
• Asymptotic distributions for random median quicksort
• Fringe analysis for extquick: An in situ distributive external sorting algorithm
• On a multivariate contraction method for random recursive structures with applications to quicksort
• Towards a realistic analysis of the QuickSelect algorithm
• Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme
• Signal language to describe the interaction of parallel processes
• Implementation of samplesort: A minimal storage tree sort
• An improved master theorem for divide-and-conquer recurrences
• An efficient external sorting with minimal space requirement
• Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
• Direct bulk-synchronous parallel algorithms
• BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small)
• Weighted height of random trees

This page was built for publication: Increasing the efficiency of quicksort

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