Título: The number of bit comparisons used by Quicksort: an average-case analysis
Autores: Fill, James Allen; The Johns Hopkins University
Janson, Svante; Uppsala University
Fecha: 2012-01-01
Publicador: Electronic journal of probability
Fuente:
Tipo: Peer-reviewed Article
Tema: Quicksort; average-case analysis of algorithms; Poissonization
60C05 (Primary) 68W40 (Secondary)
Descripción: The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and so count the number of bit comparisons.  On the other hand, the standard analyses of many other algorithms (such as Quicksort) are performed in terms of the number of key comparisons.  We introduce the prospect of a fair comparison between algorithms of the two types by providing an average-case analysis of the number of bit comparisons required by Quicksort. Counting bit comparisons rather than key comparisons introduces an extra logarithmic factor to the asymptotic average total.  We also provide a new algorithm, "BitsQuick", that reduces this factor to constant order by eliminating needless bit comparisons.
Idioma: Inglés

Artículos similares:

Lévy Classes and Self-Normalization por Khoshnevisan, Davar; University of Utah
Time-Space Analysis of the Cluster-Formation in Interacting Diffusions por Fleischmann, Klaus; Weierstrass Institute for Applied Analysis and Stochastics,Greven, Andreas; Universitat Erlangen-Nurnberg
Hausdorff Dimension of Cut Points for Brownian Motion por Lawler, Gregory F.; Duke University and Cornell University
Conditional Moment Representations for Dependent Random Variables por Bryc, Wlodzimierz; University of Cincinnati
Eigenvalue Expansions for Brownian Motion with an Application to Occupation Times por Bass, Richard F.; University of Washington,Burdzy, Krzysztof; University of Washington
Almost Sure Exponential Stability of Neutral Differential Difference Equations with Damped Stochastic Perturbations por Liao, Xiao Xin; University of Strathclyde,Mao, Xuerong; University of Strathclyde
Random Discrete Distributions Derived from Self-Similar Random Sets por Pitman, Jim; University of California, Berkeley,Yor, Marc; Université Pierre et Marie Curie
Quantitative Bounds for Convergence Rates of Continuous Time Markov Processes por Roberts, Gareth O.; University of Cambridge,Rosenthal, Jeffrey S.; University of Toronto
10 
Metastability of the Three Dimensional Ising Model on a Torus at Very Low Temperatures por Ben Arous, Gérard; Ecole Normale Supérieure,Cerf, Raphaël; Université Paris Sud