The middle pivot element algorithm (Q355523)

Summary: This paper is an improvement over the previous work on the new sorting algorithm first proposed by Sundararajan and Chakraborty in 2007. Here we have taken the pivot element as the middle element of the array. We call this improved version the 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.