Multiple Pivot Sort Algorithm is Faster than Quick Sort Algorithms: An Empirical Study

Provided by: The International Journals of Engineering & Sciences (IJENS)
Topic: Hardware
Format: PDF
Multiple pivot sort is a new comparison-based sorting algorithm that has been developed to address shortcomings in current popular comparison-based sorting algorithms. This paper is to perform an extensive empirical study of multiple pivot sort against other established sorting algorithms including quick sort, merge sort, and heap sort. This paper presents data to support the hypothesis that multiple pivot sort is an extremely promising new algorithm in a critical field of computer science. The empirical study includes comparisons of the various sorts using randomly generated arrays of size 10 data items up to 1 million or more data items.

Find By Topic