A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort (Q4950608)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort |
scientific article; zbMATH DE number 1428267
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort |
scientific article; zbMATH DE number 1428267 |
Statements
A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort (English)
0 references
9 April 2000
0 references
MDR-HEAPSORT
0 references
fine heap
0 references
0 references
0.9387814998626708
0 references
