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

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Ioannis K. Paparrizos
• Keywords: CORR 2010, Education, Worst Case, Worst Case Complexity, Worst-case Number