Average-case analysis of quicksort and binary insertion tree height using incompressibility (Q2379940)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5686389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average-case analysis of quicksort and binary insertion tree height using incompressibility |
scientific article; zbMATH DE number 5686389 |
Statements
Average-case analysis of quicksort and binary insertion tree height using incompressibility (English)
0 references
24 March 2010
0 references
analysis of algorithms
0 references
binary insertion trees
0 references
incompressibility
0 references
Kolmogorov complexity
0 references
quicksort
0 references
0 references
0.87624496
0 references
0.86888826
0 references
0.8651122
0 references
0.86136967
0 references
0.85305744
0 references
0.8458824
0 references
0.8398391
0 references
