The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Digital access to comparison-based tree data structures and algorithms
Journal of Algorithms
Journal of Algorithms - Analysis of algorithms
Rates of convergence for Quicksort
Journal of Algorithms - Analysis of algorithms
Guest Editors' Introduction: The Top 10 Algorithms
Computing in Science and Engineering
Analytic combinatorics: a calculus of discrete structures
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Compact Hilbert indices: Space-filling curves for domains with unequal side lengths
Information Processing Letters
The Number of Symbol Comparisons in QuickSort and QuickSelect
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Data-specific analysis of string sorting
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
| Hi-index | 0.00 |
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 averagecase 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.