7 search results - page 1 / 2 » Quicksort asymptotics |
JAL
2002
13 years 5 months ago
2002
The number of comparisons Xn used by Quicksort to sort an array of n distinct numbers has mean
IPL
2007
13 years 6 months ago
2007
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...
SIAMCOMP
2002
13 years 5 months ago
2002
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
SODA
2004
ACM
13 years 7 months ago
2004
ACM
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...
DAM
2006
13 years 6 months ago
2006
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...