A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm (Q4596160)
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 6814271
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm |
scientific article; zbMATH DE number 6814271 |
Statements
A Tight Bound on the Worst-Case Number of Comparisons for Floyd’s Heap Construction Algorithm (English)
0 references
30 November 2017
0 references
0 references
0.909963846206665
0 references
0.8226023316383362
0 references
0.80519038438797
0 references
0.795671284198761
0 references
0.7913436889648438
0 references
