Quicksort via Bird’s Tree Fusion Transformation

Qui ksort via Bird's Tree Fusion Transformation?

Average Case Analysis of QuickSort and Insertion Tree Height using Incompressibility

In this paper we study the Kolmogorov Complexity of a Binary Insertion Tree. We obtain a simple incompressibility argument that yields an asymptotic analysis of average tree height. This argument further implies that the QuickSort algorithm sorts a permutation of n elements in Θ(n log n) comparisons on average.

Verified Analysis of Random Trees

This work is a case study of the formal verification and complexity analysis of some famous probabilistic algorithms and data structures in the proof assistant Isabelle/HOL: the expected number of comparisons in randomised quicksort, the relationship between randomised quicksort and average-case deterministic quicksort, the expected shape of an unbalanced random Binary Search Tree, and the expe...

Do hypercubes sort faster than tree machines?

SUMMARY We develop a balanced, parallel quicksort algorithm for a hypercube and compare it with a similar algorithm for a binary tree machine. The performance of the hypercube algorithm is measured on a Computing Surface.

Approximating the limiting Quicksort distribution

The limiting distribution of the normalized number of comparisons used by Quicksort to sort an array of n numbers is known to be the unique fixed point with zero mean of a certain distributional transformation S. We study the convergence to the limiting distribution of the sequence of distributions obtained by iterating the transformation S, beginning with a (nearly) arbitrary starting distribu...