Sciweavers

Share
CORR
2010
Springer

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

11 years 7 months ago
A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm
Abstract. 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
Ioannis K. Paparrizos
Added 01 Mar 2011
Updated 01 Mar 2011
Type Journal
Year 2010
Where CORR
Authors Ioannis K. Paparrizos
Comments (0)
books