Hostname: page-component-8448b6f56d-42gr6 Total loading time: 0 Render date: 2024-04-19T16:27:02.842Z Has data issue: false hasContentIssue false
  • English
  • Français

Quicksort with Unreliable Comparisons: A Probabilistic Analysis

Published online by Cambridge University Press:  24 September 2004

LAURENT ALONSO ,
PHILIPPE CHASSAING ,
FLORENT GILLET ,
SVANTE JANSON ,
EDWARD M. REINGOLD  and
RENÉ SCHOTT
LAURENT ALONSO
Affiliation:
INRIA-Lorraine and LORIA, Université Henri Poincaré-Nancy I, BP 239, 54506, Vandœuvre-lès-Nancy, France (e-mail: Laurent.Alonso@loria.fr
PHILIPPE CHASSAING
Affiliation:
Institut Élie Cartan, Université Henri Poincaré-Nancy I, BP 239, 54506, Vandœuvre-lès-Nancy, France (e-mail: Philippe.Chassaing@antares.iecn.u-nancy.fr http://www.iecn.u-nancy.fr/~chassain/)
FLORENT GILLET
Affiliation:
Institut Élie Cartan, Université Henri Poincaré-Nancy I, BP 239, 54506, Vandœuvre-lès-Nancy, France (e-mail: Florent.Gillet@antares.iecn.u-nancy.fr)
SVANTE JANSON
Affiliation:
Department of Mathematics, Uppsala University, PO Box 480, S-751 06 Uppsala, Sweden (e-mail: svante.janson@math.uu.se http://www.math.uu.se/~svante/)
EDWARD M. REINGOLD
Affiliation:
Department of Computer Science, Illinois Institute of Technology, Stuart Building, 10 West 31st Street, Suite 236, Chicago, IL 60616-3729 U.S.A. (e-mail: reingold@iit.edu)
RENÉ SCHOTT
Affiliation:
Institut Élie Cartan and LORIA, Université Henri Poincaré-Nancy I, BP 239, 54506, Vandœuvre-lès-Nancy, France (e-mail: schott@loria.fr)
Get access Rights & Permissions [Opens in a new window]

Abstract

We provide a probabilistic analysis of the output of Quicksort when comparisons can err.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 13 , Issue 4-5 , July 2004 , pp. 419 - 449
Copyright
© 2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)