Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort

Simple item page
dc.creatorSepesi, Greg
dc.date2007-06-20
dc.date.accessioned2026-07-07T08:11:16Z
dc.date.available2026-07-07T08:11:16Z
dc.descriptionA 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.
dc.description4 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/0706.2893
dc.identifierhttp://arxiv.org/abs/0706.2893
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/132069
dc.subjectData Structures and Algorithms
dc.subjectComputational Complexity
dc.subjectDistributed, Parallel, and Cluster Computing
dc.titleDualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort
dc.typetext

Files

Collections

arXiv