The number of bit comparisons used by Quicksort, an average-case analysis

zbMATH Open1317.68292MaRDI QIDQ5501271FDOQ5501271

Authors James Allen Fill, Svante Janson 

Publication date 3 August 2015

Mathematics Subject Classification ID

Randomized algorithms (68W20) Analysis of algorithms (68W40) Searching and sorting (68P10)

Recommendations

• The number of bit comparisons used by quicksort: an average-case analysis
• How Many Comparisons Does Quicksort Use?
• A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms

Cited in

(13)

• Average-case analysis of quicksort and binary insertion tree height using incompressibility
• On a Constant Arising in the Analysis of Bit Comparisons in Quickselect
• Analysis of Branch Misses in Quicksort
• How Many Comparisons Does Quicksort Use?
• The Number of Symbol Comparisons in QuickSort and QuickSelect
• The number of bit comparisons used by quicksort: an average-case analysis
• Analysis of swaps in radix selection
• A Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq
• A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms
• Towards a realistic analysis of some popular sorting algorithms
• Compact Hilbert indices: space-filling curves for domains with unequal side lengths
• Modelling thermal transients from magmatic underplating -- an example from the Vøring margin (NE atlantic)
• Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm

This page was built for publication: The number of bit comparisons used by Quicksort, an average-case analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501271)