Review on Performance of Quick Sort Algorithm
Aoun Aftab, Hafiza Maryum Ishfaq, Muhammad Shujaat, Muhammad Awais Ali, Anum Ghaffar, Atta ur Rehman Shah · Zenodo (CERN European Organization for Nuclear Research) · 2021
Abstract: Sorting is an important part of computer science field. Many sorting algorithm available, Quicksort is one of them that based on divide and conquer technique. Quicksort algorithm was published in 1961. Partitioning is the main thing in Quicksort algorithm that done in various way. Pivot is selected in partitioning. The performance of Quicksort depends on selection of pivot. Multiple pivot sort algorithm select many pivot from the array. The performance of multiple pivot sort algorithm is better than single pivot sort. Quicksort perform better result for large dataset and it is cache friendly algorithm. In duplication of elements hybrid approach provide better result than existing quicksort algorithm, Hybrid approach minimize the time complexity when elements are repeated. Keywords Sorting, MQ sort, SMS algorithm, Quicksort algorithm, Time complexity, Hybrid Quicksort, Multiple pivot sort