Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Analysis of quickfind with small subfiles

Autor
Martinez, C.; Panario, D.; Viola, A.
Tipus d'activitat
Document cientificotècnic
Data
2001-11
Codi
LSI-01-56-R
Repositori
http://hdl.handle.net/2117/97826 Obrir en finestra nova
Resum
In this paper we investigate the variants of the well-known Hoare's Quickfind algorithm for the selection of the j-th element out of n, when recursion stops for subfiles whose size is below a predefined threshold and a simpler algorithm is run instead. We provide estimates for the combined number of passes, comparisons and exchanges, for both the basic quickfind and median-of-three quickfind. In each case, we consider two policies for the small subfiles: insertion sort and selection sort, but th...
Citació
Martinez, C., Panario, D., Viola, A. "Analysis of quickfind with small subfiles". 2001.
Paraules clau
Hoare's Quickfind Algorithm, Small Subfiles
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

Arxius