双堆排序算法：堆排序的内在并行推广
Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort
摘要：
提出了堆排序算法的一个推广。双堆排序算法比堆排序多了大约50%的比较和移动操作，但它提供了几个优于堆排序的优点：提高了缓存性能，如果输入碰巧已经排序，则性能更好，并且更容易并行实现。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
