A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A Heapify Based Parallel Sorting Algorithm
2008
Journal of Computer Science
Quick sort is a sorting algorithm whose worst case running time is (n 2 ) on an input array of n numbers. It is the best practical for sorting because it has the advantage of sorting in place. Problem statement: Behavior of quick sort is complex, we proposed in-place 2m threads parallel heap sort algorithm which had advantage in sorting in place and had better performance than classical sequential quick sort in running time. Approach: The algorithm consisted of several stages, in first stage;
doi:10.3844/jcssp.2008.897.902
fatcat:72zsdm5tyrbipfm3ykwce7ieci