Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/82162

Título:	Analysis of Hoare's FIND algorithm with median-of-three partition
Autor/a:	Kirschenhofer, P; Martínez Parra, Conrado; Prodinger, H
Otros autores:	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
Abstract:	Hoare's Find algorithm can be used to select the jth element out of a file of n elements. It bears a remarkable similarity to Quicksort; in each pass of the algorithm, a pivot element is used to split the file into two subfiles, and recursively, the algorithm proceeds with the subfile that contains the sought element. As in Quicksort, different strategies for selecting the pivot are reasonable. In this paper, we consider the Median-of-three version, where the pivot element is chosen as the median of a random sample of three elements. We give explicit formulae for both the average number of passes and comparisons, when any relative ordering of the n elements in the file is equally likely.
Materia(s):	-Àrees temàtiques de la UPC::Informàtica -Hoare's Find algorithm -Quicksort
Derechos:
Tipo de documento:	Artículo - Versión publicada Informe
Compartir:

Mostrar el registro completo del ítem