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