Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

JAL
2002

favoriteEmaildiscussreport

64views more JAL 2002»

Quicksort asymptotics

13 years 5 months ago

Quicksort asymptotics

Download www.mts.jhu.edu

The number of comparisons Xn used by Quicksort to sort an array of n distinct numbers has mean

James Allen Fill, Svante Janson

Real-time Traffic

Certain Distributional Transformation | JAL 2002 | KolmogorovSmirnov Distance | Unique Fixed Point |

claim paper

Related Content

» Averagecase analysis of QuickSort and Binary Insertion Tree height using incompressibility

» Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions

» The number of bit comparisons used by Quicksort an averagecase analysis

» A simple expected running time analysis for randomized divide and conquer algorithms

» Sorting Multisets Stably in Minimum Space

» Profiles of Random Trees Limit Theorems for Random Recursive Trees and Binary Search Trees

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	JAL
Authors	James Allen Fill, Svante Janson

Comments (0)