Sciweavers

CORR
2007
Springer

Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort

13 years 10 months ago
Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort
A generalization of the heapsort algorithm is proposed. At the expense of about 50% more comparison and move operations for typical cases, the dualheap sort algorithm offers several advantages over heapsort: improved cache performance, better performance if the input happens to be already sorted, and easier parallel implementations.
Greg Sepesi
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where CORR
Authors Greg Sepesi
Comments (0)