An in-place heapsort algorithm requiring<i>n</i>log<i>n</i>+<i>n</i>log*<i>n</i>−0.546871<i>n</i>comparisons (Q2885554)
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: An in-place heapsort algorithm requiringnlogn+nlog*n−0.546871ncomparisons |
scientific article; zbMATH DE number 6037914
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An in-place heapsort algorithm requiring<i>n</i>log<i>n</i>+<i>n</i>log*<i>n</i>−0.546871<i>n</i>comparisons |
scientific article; zbMATH DE number 6037914 |
Statements
An in-place heapsort algorithm requiring<i>n</i>log<i>n</i>+<i>n</i>log*<i>n</i>−0.546871<i>n</i>comparisons (English)
0 references
23 May 2012
0 references
heapsort algorithm
0 references
data structure
0 references
0.9012922
0 references
0.88595384
0 references
0.88549334
0 references
0.85931844
0 references
0.85035527
0 references
0.84526485
0 references
