@article {10.3844/jcssp.2008.897.902,
article_type = {journal},
title = {A Heapify Based Parallel Sorting Algorithm},
author = {Hija, M. A.A.A. and Zabian, A. and Qawasmeh, S. and Haija, O. H.A.A.},
volume = {4},
number = {11},
year = {2008},
month = {Nov},
pages = {897-902},
doi = {10.3844/jcssp.2008.897.902},
url = {https://thescipub.com/abstract/jcssp.2008.897.902},
abstract = {Quick sort is a sorting algorithm whose worst case running time is θ(n2) 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; it splits input data into two partitions, next stages it did the same partitioning for prior stage which had been spitted until 2 m partitions was reached equal to the number of available processors, finally it used heap sort to sort respectively ordered of non internally sorted partitions in parallel. Results: Results showed the speed of algorithm about double speed of classical Quick sort for a large input size. The number of comparisons needed was reduced significantly. Conclusion: In this study we had been proposed a sorting algorithm that uses less number of comparisons with respect to original quick sort that in turn requires less running time to sort the same input data.},
journal = {Journal of Computer Science},
publisher = {Science Publications}
}