2012
DOI: 10.3233/fi-2012-751
|View full text |Cite
|
Sign up to set email alerts
|

Elementary Yet Precise Worst-Case Analysis of Floyd's Heap-Construction Program

Abstract: The worst-case behavior of the heap-construction phase of Heapsort escaped mathematically precise characterization by a closed-form formula for almost five decades. This paper offers a proof that the exact number of comparisons of keys performed in the worst case during construction of a heap of size N is: 2N − 2s2(N) − e2(N), where s2(N) is the sum of all digits of the binary representation of N and e2(N) is the exponent of 2 in the prime factorization of N. It allows for derivation of this best-known upper b… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 3 publications
0
2
0
Order By: Relevance
“…The details are as follows: For each chromosome, convert the chromosome’s peak associations into an array. For each chromosome, convert the chromosome’s array into a binary max-heap keyed on the –Log10( P ) of each genotype/phenotype pair, using the O ( n ) running time heapify algorithm described in 59 . For each chromosome, while the chromosome’s heap is not empty, extract the maximum genetic variant/phenotype pair from the heap to create a new cluster.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The details are as follows: For each chromosome, convert the chromosome’s peak associations into an array. For each chromosome, convert the chromosome’s array into a binary max-heap keyed on the –Log10( P ) of each genotype/phenotype pair, using the O ( n ) running time heapify algorithm described in 59 . For each chromosome, while the chromosome’s heap is not empty, extract the maximum genetic variant/phenotype pair from the heap to create a new cluster.…”
Section: Methodsmentioning
confidence: 99%
“…For each chromosome, convert the chromosome’s array into a binary max-heap keyed on the –Log10( P ) of each genotype/phenotype pair, using the O ( n ) running time heapify algorithm described in 59 .…”
Section: Methodsmentioning
confidence: 99%