Quicksort with unreliable comparisons: a probabilistic analysis
classification
🧮 math.PR
keywords
analysiscomparisonsprobabilisticquicksortoutputunreliablewhen
read the original abstract
We provide a probabilistic analysis of the output of Quicksort when comparisons can err.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.