Abstract

Sorting is among the first of algorithm, than any computer science student encounters during college and it is considered as a simple and well studied problem. With the advancement in parallel processing many parallel sorting algorithms have been investigated. These algorithms are designed for a variety of parallel computer architectures. In this paper, a comparative analysis of performance of three different types of sorting algorithms viz. sequential quick sort, parallel quick sort and hyperquicksort is presented. Quick sort is a divideand-conquer algorithm that sorts a sequence by recursively dividing it into smaller subsequences, and has Ө(nlogn) complexity for n data values. The comparative analysis is based on comparing average sorting times and speedup achieved in parallel sorting over sequential quick sort and comparing number of comparisons. The time complexity for each sorting algorithm will also be mentioned and analyzed.

Citations