Implementing Quicksort programs
From MaRDI portal
Publication:4167589
DOI10.1145/359619.359631zbMath0386.68058OpenAlexW2040046786WikidataQ54086703 ScholiaQ54086703MaRDI QIDQ4167589
Publication date: 1978
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359619.359631
Related Items
A generalized, one-way, stackless quicksort ⋮ Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme ⋮ Optimal full ranking from pairwise comparisons ⋮ On Smoothed Analysis of Quicksort and Hoare’s Find ⋮ Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge ⋮ On smoothed analysis of quicksort and Hoare's find ⋮ An algorithm for the solution of the 0-1 knapsack problem ⋮ Usort: An efficient hybrid of distributive partitioning sorting ⋮ Sorting numbers in linear expected time and optimal extra space ⋮ Sorting a linked list with equal keys ⋮ BlockQuicksort ⋮ A note on dominance relation in unbounded knapsack problems ⋮ Integrating Pareto optimization into dynamic programming ⋮ Analysis of swaps in radix selection ⋮ Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem ⋮ The analysis of Quicksort programs ⋮ Improving multikey Quicksort for sorting strings with many equal elements ⋮ Insertion merge sorting ⋮ A note on iterative marginal optimization: a simple algorithm for maximum rank correlation estimation ⋮ A space efficient distributive sort ⋮ Statistical analysis of steady-state simulations: Survey of recent progress ⋮ Sorting Algorithms in MOQA ⋮ Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm ⋮ Re-describing an algorithm by Hopcroft ⋮ Efficient sorting during repetitive statistical computations: Algorithms and an application ⋮ Sorting in linear expected time ⋮ Analysis of the performance of the parallel quicksort method ⋮ QuickHeapsort, an efficient mix of classical sorting algorithms
