The number of bit comparisons used by quicksort: an average-case analysis
type: Item
instance of: scholarly article
title: The number of bit comparisons used by quicksort: an average-case analysis
zbMATH Open document ID: 1244.68090
author: James Allen Fill
author: Svante Janson
published in: Electronic Journal of Probability
publication date: 2012-06-22T00:00:00Z
full work available at URL: https://arxiv.org/abs/1202.2595
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 60C05
zbMATH DE Number: 6049191
zbMATH Keywords: quicksort
zbMATH Keywords: average-case analysis of algorithms
zbMATH Keywords: Poissonization
MaRDI profile type: Publication
arXiv ID: 1202.2595
DOI: 10.1214/EJP.V17-1812
Recommended article: Q5501271
Recommended article: Analysis of the expected number of bit comparisons required by quickselect
Recommended article: On a Constant Arising in the Analysis of Bit Comparisons in Quickselect
Recommended article: Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm
Recommended article: Average Case and Distributional Analysis of Dual-Pivot Quicksort
Recommended article: The Number of Symbol Comparisons in QuickSort and QuickSelect
Recommended article: Average-case analysis of quicksort and binary insertion tree height using incompressibility
Recommended article: Q2959907
Recommended article: Distributional convergence for the number of symbol comparisons used by QuickSort
description: scientific article; zbMATH DE number 6049191