The following pages link to Implementing Quicksort programs (Q4167589):
Displaying 28 items.
- Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme (Q308946) (← links)
- A space efficient distributive sort (Q758207) (← links)
- Statistical analysis of steady-state simulations: Survey of recent progress (Q759472) (← links)
- Efficient sorting during repetitive statistical computations: Algorithms and an application (Q804105) (← links)
- Improving multikey Quicksort for sorting strings with many equal elements (Q987791) (← links)
- A note on iterative marginal optimization: a simple algorithm for maximum rank correlation estimation (Q1019910) (← links)
- Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm (Q1040789) (← links)
- Sorting in linear expected time (Q1064785) (← links)
- Analysis of the performance of the parallel quicksort method (Q1070824) (← links)
- A generalized, one-way, stackless quicksort (Q1094881) (← links)
- Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge (Q1123621) (← links)
- An algorithm for the solution of the 0-1 knapsack problem (Q1156694) (← links)
- Usort: An efficient hybrid of distributive partitioning sorting (Q1162815) (← links)
- Sorting numbers in linear expected time and optimal extra space (Q1167543) (← links)
- Sorting a linked list with equal keys (Q1171387) (← links)
- A note on dominance relation in unbounded knapsack problems (Q1180824) (← links)
- The analysis of Quicksort programs (Q1225454) (← links)
- Insertion merge sorting (Q1244815) (← links)
- Re-describing an algorithm by Hopcroft (Q1589443) (← links)
- QuickHeapsort, an efficient mix of classical sorting algorithms (Q1608335) (← links)
- Integrating Pareto optimization into dynamic programming (Q1736764) (← links)
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem (Q1761937) (← links)
- Optimal full ranking from pairwise comparisons (Q2148998) (← links)
- On smoothed analysis of quicksort and Hoare's find (Q2428694) (← links)
- Analysis of swaps in radix selection (Q3021249) (← links)
- BlockQuicksort (Q4629535) (← links)
- Sorting Algorithms in MOQA (Q4982076) (← links)
- On Smoothed Analysis of Quicksort and Hoare’s Find (Q5323060) (← links)
