Quicksort with Equal Keys
From MaRDI portal
Publication:4128002
DOI10.1137/0206018zbMath0356.68053OpenAlexW2000538582MaRDI QIDQ4128002
Publication date: 1977
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bce90bcd0df53a74bc9283a50f662e242ff91811
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items
Towards a realistic analysis of the QuickSelect algorithm, A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries, Analysis of quickselect : an algorithm for order statistics, Unnamed Item, Sorting a linked list with equal keys, Phase changes in randomm-ary search trees and generalized quicksort, The analysis of Quicksort programs, Improving multikey Quicksort for sorting strings with many equal elements, Sorting Algorithms in MOQA, Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm, Probabilistic analysis of algorithms for the Dutch national flag problem, An efficient external sorting with minimal space requirement, On Floyd and Rivest's SELECT algorithm, Asymptotic analysis of an optimized quicksort algorithm.
