Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
4 pages, 4 figures

Keywords

Data Structures and Algorithms, Computational Complexity, Distributed, Parallel, and Cluster Computing

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/132069

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0706.2893
 http://arxiv.org/abs/0706.2893

Collections

arXiv