A Heapify Based Parallel Sorting Algorithm

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; 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.