Table of Contents
ISRN Computational Mathematics
Volume 2012 (2012), Article ID 947634, 5 pages
Research Article

The Middle Pivot Element Algorithm

1Department of Statistics, Patna University, Patna 800005, India
2Department of Applied Mathematics, Birla Institute of Technology (BIT Mesra), Ranchi 835215, India

Received 7 November 2012; Accepted 29 November 2012

Academic Editors: P. Amodio, R. López-Ruiz, and Q.-W. Wang

Copyright © 2012 Anchala Kumari and Soubhik Chakraborty. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


This paper is an improvement over the previous work on New Sorting Algorithm first proposed by Sundararajan and Chakraborty (2007). Here we have taken the pivot element as the middle element of the array. We call this improved version Middle Pivot Element Algorithm (MPA) and it is found that MPA is much faster than the two algorithms RPA (Random Pivot element Algorithm) and FPA (First Pivot element Algorithm) in which the pivot element was selected either randomly or as the first element, respectively.