Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2011.020523
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 2 Issue 5, 2011.
Abstract: Partitioning is a central component of the Quicksort which is an intriguing sorting algorithm, and is a part of C, C++ and Java libraries. Partitioning is a key component of Quicksort, on which the performance of Quicksort ultimately depends. There have been some elegant partitioning algorithms; Profound understanding of prior may be needed if one has to choose among those partitioning algorithms. In this paper we undertake a careful study of these algorithms on modern machines with the help of state of the art performance analyzers, choose the best partitioning algorithm on the basis of some crucial performance indicators.
D Abhyankar and M.Ingle, “A Performance Study of Some Sophisticated Partitioning Algorithms ” International Journal of Advanced Computer Science and Applications(IJACSA), 2(5), 2011. http://dx.doi.org/10.14569/IJACSA.2011.020523