Running time of the treapsort algorithm (Q387004)
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 6237425
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Running time of the treapsort algorithm |
scientific article; zbMATH DE number 6237425 |
Statements
Running time of the treapsort algorithm (English)
0 references
11 December 2013
0 references
average-case analysis of algorithms
0 references
smoothed complexity
0 references
sorting algorithms
0 references
\(\mathcal{MOQA}\)
0 references
0 references
0 references
0.7176522016525269
0 references
0.7156538963317871
0 references
0.7021110653877258
0 references
0.6987975239753723
0 references
0.6840360760688782
0 references
