Quicksort

DOI10.1093/comjnl/5.1.10zbMath0108.13601OpenAlexW4235295823WikidataQ29305736 ScholiaQ29305736MaRDI QIDQ5904100

C. A. R. Hoare

Publication date: 1962

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/5.1.10

zbMATH Keywords

numerical analysis

Related Items (only showing first 100 items - show all)

Synthetic-perturbation tuning of MIMD programs ⋮ A one-way, stackless quicksort algorithm ⋮ Towards a realistic analysis of the QuickSelect algorithm ⋮ A study on interleaving versus segmentation ⋮ Optimizing sorting algorithms by using sorting networks ⋮ Being and Change: Reasoning About Invariance ⋮ A generalized, one-way, stackless quicksort ⋮ Direct bulk-synchronous parallel algorithms ⋮ On quickselect, partial sorting and multiple Quickselect ⋮ A VLSI partition algorithm ⋮ An efficient implementation of the Min-Min heuristic ⋮ Efficient sample sort and the average case analysis of PEsort ⋮ Some properties of a limiting distribution in Quicksort ⋮ Range selection and predecessor queries in data aware space and time ⋮ Thin tails of fixed points of the nonhomogeneous smoothing transform ⋮ An improved master theorem for divide-and-conquer recurrences ⋮ Logarithmic integrals, zeta values, and tiered binomial coefficients ⋮ Average-case analysis of multiple Quickselect: An algorithm for finding order statistics ⋮ A minimal algorithm for the multiple-choice knapsack problem ⋮ The weak-heap data structure: variants and applications ⋮ A minimal algorithm for the Bounded Knapsack Problem ⋮ Second phase changes in random \(m\)-ary search trees and generalized quicksort: Convergence rates ⋮ An efficient threshold dynamics method for wetting on rough surfaces ⋮ Homogeneous and Non-homogeneous Algorithms ⋮ Unnamed Item ⋮ Analysis of multiple quickselect variants. ⋮ Analysis of quickselect : an algorithm for order statistics ⋮ Almost sure convergence to the quicksort process ⋮ Robust classification via MOM minimization ⋮ Fast neighbor lists for adaptive-resolution particle simulations ⋮ The quicksort process ⋮ Distributional convergence for the number of symbol comparisons used by QuickSort ⋮ Limit distribution of the quartet balance index for Aldous’s $(\beta \ge 0)$-model ⋮ Halting time is predictable for large models: a universality property and average-case analysis ⋮ An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable ⋮ The saga of minimum spanning trees ⋮ An intuitive and simple bounding argument for Quicksort ⋮ Sorting numbers in linear expected time and optimal extra space ⋮ The analysis of range quickselect and related problems ⋮ On densities for solutions to stochastic fixed point equations ⋮ Sorting a linked list with equal keys ⋮ Classification of time series by shapelet transformation ⋮ Cost-sensitive active learning with a label uniform distribution model ⋮ Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons ⋮ Qos-aware service evaluation and selection ⋮ Weighted height of random trees ⋮ Algorithms for the minimum diameter terminal Steiner tree problem ⋮ Height balance distribution of search trees ⋮ Faster suffix sorting ⋮ Using synthetic perturbations and statistical screening to assay shared-memory programs ⋮ Asymptotic distributions for random median quicksort ⋮ An optimization algorithm for a penalized knapsack problem ⋮ Stories about groups and sequences ⋮ A social learning particle swarm optimization algorithm for scalable optimization ⋮ Engineering parallel string sorting ⋮ Computing inversion pair cardinality through partition-based sorting ⋮ Analysis of swaps in radix selection ⋮ BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small) ⋮ A limiting distribution for quicksort ⋮ The total path length of split trees ⋮ Distributional analysis of swaps in quick select ⋮ The fluctuations of the giant cluster for percolation on random split trees ⋮ Local polynomial Fourier transform: a review on recent developments and applications ⋮ An efficient algorithm for the collapsing knapsack problem ⋮ Applying Sorting Networks to Synthesize Optimized Sorting Libraries ⋮ Uniform distribution modulo one and binary search trees ⋮ A limit theorem for “quicksort” ⋮ The analysis of Quicksort programs ⋮ Improving multikey Quicksort for sorting strings with many equal elements ⋮ Sortieren bei virtuellem Speicher ⋮ An augmenting path method for solving linear bottleneck assignment problems ⋮ The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance ⋮ Verified analysis of random binary tree structures ⋮ QuickhullDisk: a faster convex hull algorithm for disks ⋮ Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction ⋮ On the complexity of project scheduling to minimize exposed time ⋮ On weighted depths in random binary search trees ⋮ Embedding small digraphs and permutations in binary trees and split trees ⋮ An augmenting path method for solving linear bottleneck transportation problems ⋮ Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths ⋮ Moves and displacements of particular elements in quicksort ⋮ Quicksort algorithm: application of a fixed point theorem in intuitionistic fuzzy quasi-metric spaces at a domain of words ⋮ Inversions in Split Trees and Conditional Galton–Watson Trees ⋮ A note concerning the limit distribution of the quicksort algorithm ⋮ Quicksort ⋮ Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey ⋮ Query-Competitive Sorting with Uncertainty. ⋮ New applications of random sampling in computational geometry ⋮ Sorting Algorithms in MOQA ⋮ Applications of random sampling in computational geometry. II ⋮ Linear sorting with O(log n) processors ⋮ Re-describing an algorithm by Hopcroft ⋮ Asymptotic analysis of an optimized quicksort algorithm. ⋮ Reporting intersections among thick objects. ⋮ A simple expected running time analysis for randomized ``divide and conquer algorithms ⋮ An algorithm for \(\ell^\infty\) regression with quadratic complexity ⋮ On resampling schemes for particle filters with weakly informative observations ⋮ Analysis of the performance of the parallel quicksort method ⋮ Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm ⋮ The asymptotic distribution of cluster sizes for supercritical percolation on random split trees

This page was built for publication: Quicksort