The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than \(n \log n+1.1n\) (Q1186810)
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: The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than \(n \log n+1.1n\) |
scientific article; zbMATH DE number 37181
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than \(n \log n+1.1n\) |
scientific article; zbMATH DE number 37181 |
Statements
The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than \(n \log n+1.1n\) (English)
0 references
28 June 1992
0 references
bottom-up heapsort
0 references
heapsort
0 references
quicksort
0 references
