Implementing <i>HEAPSORT</i> with ( <i>n</i> log <i>n</i> - 0.9 <i>n</i> ) and <i>QUICKSORT</i> with ( <i>n</i> log <i>n</i> + 0.2 <i>n</i> ) comparisons (Q5463432)
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: Implementing HEAPSORT with ( n log n - 0.9 n ) and QUICKSORT with ( n |
scientific article; zbMATH DE number 2192062
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Implementing <i>HEAPSORT</i> with ( <i>n</i> log <i>n</i> - 0.9 <i>n</i> ) and <i>QUICKSORT</i> with ( <i>n</i> log <i>n</i> + 0.2 <i>n</i> ) comparisons |
scientific article; zbMATH DE number 2192062 |
Statements
Implementing <i>HEAPSORT</i> with ( <i>n</i> log <i>n</i> - 0.9 <i>n</i> ) and <i>QUICKSORT</i> with ( <i>n</i> log <i>n</i> + 0.2 <i>n</i> ) comparisons (English)
0 references
4 August 2005
0 references
weak-heap-sort algorithm
0 references
