IAJIT
2010
13 years 10 months ago
2010
: Sorting is considered as one of the important issues of computer science. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal of res...
JAL
2002
13 years 11 months ago
2002
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...
CORR
2000
Springer
13 years 11 months ago
2000
Springer
The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional...