## Performance Comparison of Sequential Quick Sort and Parallel Quick Sort Algorithms

### BibTeX

@MISC{Rajput_performancecomparison,

author = {Ishwari Singh Rajput and Bhawnesh Kumar and Tinku Singh},

title = {Performance Comparison of Sequential Quick Sort and Parallel Quick Sort Algorithms},

year = {}

}

### OpenURL

### 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

9279 | Introduction to Algorithms
- Cormen, Leiserson, et al.
- 2009
(Show Context)
Citation Context ... for T(0) c(1) 1 T(n) = (n 2 ) Fig 3: Recursion tree for worst case of Sequential quick sort algorithm Therefore, the running time is : T(n) = (n 2 ). 2.1.3 Average Case The average-case running time =-=[8]-=- of quick sort is much closer to the best case than to the worst case. Let the partitioning algorithm always produces a 9-to-1 proportional split, which seems quite unbalanced. The recurrence relation... |

765 |
The Art of Computer Programming, Volume 3/ Sorting and Searching
- Knuth
- 1973
(Show Context)
Citation Context ...ODUCTION Sorting is a fundamental operation that is performed by most computers [1].It is a computational building block of basic importance and is one of the most widely studied algorithmic problems =-=[2]-=-. Sorted data are easier to manipulate than randomly-ordered data, so many algorithms require sorted data. It is used frequently in a large variety of useful applications. All spreadsheet programs con... |

185 |
The design and analysis of parallel algorithms
- Akl
- 1989
(Show Context)
Citation Context ...hniques are suggested in order to increase the efficiency of the parallel implementation of the quick sort algorithm based on ideas used for parallel implementation of a variety of sorting algorithms =-=[11, 12]-=-. The current trends of hardware development and innovations are oriented towards extensive usage of high-performance computations based on multicomputer and multiprocessor computer systems. Grid and ... |

182 |
Parallel Computing: Theory and Practice
- Quinn
- 1994
(Show Context)
Citation Context ...hniques are suggested in order to increase the efficiency of the parallel implementation of the quick sort algorithm based on ideas used for parallel implementation of a variety of sorting algorithms =-=[11, 12]-=-. The current trends of hardware development and innovations are oriented towards extensive usage of high-performance computations based on multicomputer and multiprocessor computer systems. Grid and ... |

108 |
Introduction to Parallel Computing
- Grama, Gupta, et al.
- 2003
(Show Context)
Citation Context ...anies, banks, and other institutions all contain sorting code. Because of the importance of sorting in these applications, many sorting algorithms have been developed with varying complexity. Sorting =-=[3, 4]-=- is defined as the operation of arranging an unordered collection of elements into monotonically increasing (or decreasing) order. Specifically, S= {a 1, a 2 ………….a n} be a sequence of n elements in r... |

90 | Parallel Sorting Algorithms - Akl - 1985 |

55 | Quicksort - Hoare - 1962 |

34 |
Parallel Programming in C with MPI and OpenMP
- Quinn
- 2003
(Show Context)
Citation Context ...anies, banks, and other institutions all contain sorting code. Because of the importance of sorting in these applications, many sorting algorithms have been developed with varying complexity. Sorting =-=[3, 4]-=- is defined as the operation of arranging an unordered collection of elements into monotonically increasing (or decreasing) order. Specifically, S= {a 1, a 2 ………….a n} be a sequence of n elements in r... |

16 |
The Algorithm Design
- Skiena
- 1998
(Show Context)
Citation Context ...e, O(nlogn) comparisons to sort n items. In the worst case scenario, it makes O(n 2 ) comparisons, even though this is a rare occurrence. In reality it is mostly faster than other O(nlogn) algorithms =-=[6]-=-. It is also known as a partition-exchange sort because that term captures the basic idea of the method. The implementation of a simple sequential quick sort algorithm [7] follows the following steps:... |

13 |
Parallel quicksort using Fetch-and-Add
- Heidelberger, Norton, et al.
- 1990
(Show Context)
Citation Context ...e a better performing sorting algorithm but it is also considered to be one of reliable algorithm which can be parallelized. The key feature of Parallel Quicksort is parallel partitioning of the data =-=[13]-=-. The parallel generalization of the quick sort algorithm [4] may be obtained in the simplest way for a network of processing elements. The topology adapted by network is a Ddimensional hypercube (i.e... |

3 |
The Parallel Neighbor Sort and Two-way Merge Algorithm, Parallel Computing 3
- Evans, Yousif
- 1986
(Show Context)
Citation Context ...o smaller ordered subsets. It appears to be a difficult problem to find pivots that partition the data to be sorted into ordered subsets of equal size without sorting the data first. The basic result =-=[14]-=- is that initial data splitting limits the speedup to a maximum, i.e. about 5 or 6, regardless of how many processors are used. The ability to partition the data evenly into ordered subsets is essenti... |

1 |
Viral Kapadiya, Performance Study of Efficient Quick Sort and Other Sorting Algorithms for Repeated Data
- Desai
- 2011
(Show Context)
Citation Context ...s Algorithm, quick sort, parallel sorting algorithms, parallel quick sort, hyperquicksort, performance analysis. 1. INTRODUCTION Sorting is a fundamental operation that is performed by most computers =-=[1]-=-.It is a computational building block of basic importance and is one of the most widely studied algorithmic problems [2]. Sorted data are easier to manipulate than randomly-ordered data, so many algor... |

1 |
Almutairi & Abdulrahman Helal Alruwaili, Improving of Quick sort Algorithm performance by Sequential Thread or Parallel Algorithms
- Hamed
- 2012
(Show Context)
Citation Context ...an other O(nlogn) algorithms [6]. It is also known as a partition-exchange sort because that term captures the basic idea of the method. The implementation of a simple sequential quick sort algorithm =-=[7]-=- follows the following steps: � � Choose a pivot element Place all numbers smaller then the pivot element to a position on its left, while placing all other 14International Journal of Computer Applic... |

1 | Synthesis and Analysis of Parallel Algorithms - Borovska |