2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/132069A 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 figuresData Structures and AlgorithmsComputational ComplexityDistributed, Parallel, and Cluster Computingtext