A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm

Details A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm

2010-12-05

arxiv.org/abs/1012.0956v3

Computer Science

Data Structures and Algorithms

This (full) paper was accepted for publication in the 37th International Conference on Current Trends in Theory and Practice o

Scientific paper

In this paper a tight bound on the worst-case number of comparisons for
Floyd's well known heap construction algorithm, is derived. It is shown that at
most 2n-2{\mu}(n)-{\sigma}(n) comparisons are executed in the worst case, where
{\mu}(n) is the number of ones and {\sigma}(n) is the number of zeros after the
last one in the binary representation of the number of keys n.

Affiliated with

Also associated with

No associations

Rating

A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-517277