The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than \(n \log n+1.1n\) (Q1186810): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56049342, #quickstatements; #temporary_batch_1706390585872 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56049342 / rank | |||
Normal rank | |||
Revision as of 23:23, 27 January 2024
scientific article
| 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 |
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
