Quicksort with Equal Keys

DOI10.1137/0206018MaRDI QIDQ4128002zbMATH OpenOpenAlexFDO

Authors Robert Sedgewick

Publication date 1977

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/bce90bcd0df53a74bc9283a50f662e242ff91811

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(15)

• Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm
• Sorting a linked list with equal keys
• The analysis of Quicksort programs
• Asymptotic analysis of an optimized quicksort algorithm.
• A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries
• Probabilistic analysis of algorithms for the Dutch national flag problem
• On Floyd and Rivest's SELECT algorithm
• Phase changes in random m-ary search trees and generalized quicksort
• Towards a realistic analysis of the QuickSelect algorithm
• An efficient external sorting with minimal space requirement
• Analysis of quickselect : an algorithm for order statistics
• Sorting algorithms in \textsc{MOQA}
• Nearly-optimal mergesorts: fast, practical sorting methods that optimally adapt to existing runs
• Tony Hoare: his path to the ACM Turing Award
• Improving multikey Quicksort for sorting strings with many equal elements

This page was built for publication: Quicksort with Equal Keys

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