The Middle Pivot Element Algorithm. (6th December 2012)

• Record Type: Journal Article
• Authors: Kumari, Anchala; Chakraborty, Soubhik
• Other Names: Amodio P. Academic Editor.; López-Ruiz R. Academic Editor.; Wang Q.-W. Academic Editor.
• Is Part Of: ISRN computational mathematics. Volume 2012(2012)
• Publication Date: 2012-12-06
• Subjects: Numerical analysis -- Periodicals; Mathematics -- Data processing -- Periodicals; Mathematics -- Data processing; Numerical analysis; Electronic journals; Periodicals; 510
• DOI: 10.5402/2012/947634
• Languages: English
• ISSNs: 2090-7842

Abstract

Abstract : 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.