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
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A variant of heapsort with almost optimal number of comparisons / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Average-case results on heapsort / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Deleting the root of a heap / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An average case analysis of Floyd's algorithm to construct heaps / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Building heaps fast / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small) / rank | |||
Normal rank | |||
Latest revision as of 16:13, 15 May 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
