5 citations · 5 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2010
A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm
Ioannis Paparrizos
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μ(n)-σ(n) compariso…
cs.DS2010
Homogeneous and Non Homogeneous Algorithms
Ioannis Paparrizos
Motivated by recent best case analyses for some sorting algorithms and based on the type of complexity we partition the algorithms into two classes: homogeneous and non homogeneous…