Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

Elementary Yet Precise Worst-Case Analysis of Floyd's Heap-Construction Program 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 − 2s 2 (N) − e 2 (N), where s 2 (N) is the sum of all digits of the binary representation of N and e 2 (N) is the exponent of 2 in the prime factorization of N. It allows for derivation of this best-known upper bound on the number of comparisons of Heapsort: (2N − 1)$\lceil$lgN$\rceil$ − 2 $\lceil$lgN$\rceil$+1 − 2s 2 (N) − e 2 (N) + 5. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Fundamenta Informaticae IOS Press

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

Suchenek, Marek A.
Fundamenta Informaticae , Volume 120 (1) – Jan 1, 2012
Download PDF
18 pages

Loading next page...
 
/lp/ios-press/elementary-yet-precise-worst-case-analysis-of-floyd-s-heap-50NW30HMxU

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
IOS Press
Copyright
Copyright © 2012 by IOS Press, Inc
ISSN
0169-2968
eISSN
1875-8681
DOI
10.3233/FI-2012-751
Publisher site
See Article on Publisher Site

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 − 2s 2 (N) − e 2 (N), where s 2 (N) is the sum of all digits of the binary representation of N and e 2 (N) is the exponent of 2 in the prime factorization of N. It allows for derivation of this best-known upper bound on the number of comparisons of Heapsort: (2N − 1)$\lceil$lgN$\rceil$ − 2 $\lceil$lgN$\rceil$+1 − 2s 2 (N) − e 2 (N) + 5.

Journal

Fundamenta Informaticae – IOS Press

Published: Jan 1, 2012

There are no references for this article.