Per citar aquest document:
The analysis of approximate quickselect and related problems
Martínez Parra, Conrado
Panholzer, Alois
Prodinger, Helmut
Centre de Recerca Matemàtica

Publicació: Centre de Recerca Matemàtica 2009
Descripció: 29 p.
Resum: Approximate Quickselect, a simple modification of the well known Quickselect algorithm for selection, can be used to efficiently find an element with rank k in a given range [i. . j], out of n given elements. We study basic cost measures of Approximate Quickselect by computing exact and asymptotic results for the expected number of passes, comparisons and data moves during the execution of this algorithm. The key element appearing in the analysis of Approximate Quickselect is a trivariate recurrence that we solve in full generality. The general solution of the recurrence proves to be very useful, as it allows us to tackle several related problems, besides the analysis that originally motivated us. In particular, we have been able to carry out a precise analysis of the expected number of moves of the ith element when selecting the jth smallest element with standard Quickselect, where we are able to give both exact and asymptotic results. Moreover, we can apply our general results to obtain exact and asymptotic results for several parameters in binary search trees, namely the expected number of common ancestors of the nodes with rank i and j, the expected size of the subtree rooted at the least common ancestor of the nodes with rank i and j, and the expected distance between the nodes of ranks i and j.
Drets: Aquest document està subjecte a una llicència d'ús de Creative Commons, amb la qual es permet copiar, distribuir i comunicar públicament l'obra sempre que se'n citin l'autor original, la universitat i el centre i no se'n faci cap ús comercial ni obra derivada, tal com queda estipulat en la llicència d'ús Creative Commons
Llengua: Anglès.
Col·lecció: Prepublicacions del Centre de Recerca Matemàtica
Col·lecció: Prepublicacions del Centre de Recerca Matemàtica ; 901
Document: preprint
Matèria: Anàlisi combinatòria

Adreça alternativa:

29 p, 247.6 KB

El registre apareix a les col·leccions:
Documents de recerca > Prepublicacions

 Registre creat el 2010-04-14, darrera modificació el 2016-06-11

   Favorit i Compartir