Quicksort with Equal Keys
From MaRDI portal
Publication:4128002
DOI10.1137/0206018zbMATH Open0356.68053OpenAlexW2000538582MaRDI QIDQ4128002FDOQ4128002
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
General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)
Cited In (14)
- Probabilistic analysis of algorithms for the Dutch national flag problem
- Sorting a linked list with equal keys
- The analysis of Quicksort programs
- Towards a realistic analysis of the QuickSelect algorithm
- A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries
- Phase changes in random \(m\)-ary search trees and generalized quicksort
- Improving multikey Quicksort for sorting strings with many equal elements
- Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm
- Sorting algorithms in \textsc{MOQA}
- Asymptotic analysis of an optimized quicksort algorithm.
- On Floyd and Rivest's SELECT algorithm
- Title not available (Why is that?)
- An efficient external sorting with minimal space requirement
- Analysis of quickselect : an algorithm for order statistics
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)
