Sciweavers

IPL
2007

Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility

13 years 3 months ago
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
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 on the encoding scheme, we obtain a simple incompressibility argument that yields an asymptotic analysis of the average height of a Binary Insertion Tree. This argument further implies that the QuickSort algorithm sorts a permutation of n elements in (nlgn) comparisons on average. © 2007 Elsevier B.V. All rights reserved.
Brendan Lucier, Tao Jiang, Ming Li
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where IPL
Authors Brendan Lucier, Tao Jiang, Ming Li
Comments (0)