Quicksort with unreliable comparisons: a probabilistic analysis
Probability
2007-05-23 v1
Abstract
We provide a probabilistic analysis of the output of Quicksort when comparisons can err.
Cite
@article{arxiv.math/0312437,
title = {Quicksort with unreliable comparisons: a probabilistic analysis},
author = {L. Alonso and P. Chassaing and F. Gillet and S. Janson and E. M. Reingold and R. Schott},
journal= {arXiv preprint arXiv:math/0312437},
year = {2007}
}
Comments
29 pages, 3 figures