Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort

Details Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort

2007-06-20

arxiv.org/abs/0706.2893v1

Computer Science

Data Structures and Algorithms

4 pages, 4 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-33951