Implementing Quicksort programs

Cited in

(30)

A note on iterative marginal optimization: a simple algorithm for maximum rank correlation estimation
Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm
Sorting in linear expected time
Analysis of the performance of the parallel quicksort method
A generalized, one-way, stackless quicksort
Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge
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
A note on dominance relation in unbounded knapsack problems
The analysis of Quicksort programs
Insertion merge sorting
Re-describing an algorithm by Hopcroft
QuickHeapsort, an efficient mix of classical sorting algorithms
Integrating Pareto optimization into dynamic programming
Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
Optimal full ranking from pairwise comparisons
On smoothed analysis of quicksort and Hoare's find
Analysis of swaps in radix selection
Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme
BlockQuicksort: avoiding branch mispredictions in Quicksort
Sorting algorithms in \textsc{MOQA}
On Smoothed Analysis of Quicksort and Hoare’s Find
Order-of-addition experiments for sequential adjacency relationship problems
Tony Hoare: his path to the ACM Turing Award
A space efficient distributive sort
Statistical analysis of steady-state simulations: Survey of recent progress
Efficient sorting during repetitive statistical computations: Algorithms and an application
Improving multikey Quicksort for sorting strings with many equal elements

This page was built for publication: Implementing Quicksort programs

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