![](/images/graphics-bg.png)
The Middle Pivot Element Algorithm
Joint Authors
Chakraborty, Soubhik
Kumari, Anchala
Source
ISRN Computational Mathematics
Issue
Vol. 2012, Issue 2012 (31 Dec. 2012), pp.1-5, 5 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2012-12-31
Country of Publication
Egypt
No. of Pages
5
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Kumari, Anchala& Chakraborty, Soubhik. 2012. The Middle Pivot Element Algorithm. ISRN Computational Mathematics،Vol. 2012, no. 2012, pp.1-5.
https://search.emarefa.net/detail/BIM-510495
Modern Language Association (MLA)
Kumari, Anchala& Chakraborty, Soubhik. The Middle Pivot Element Algorithm. ISRN Computational Mathematics No. 2012 (2012), pp.1-5.
https://search.emarefa.net/detail/BIM-510495
American Medical Association (AMA)
Kumari, Anchala& Chakraborty, Soubhik. The Middle Pivot Element Algorithm. ISRN Computational Mathematics. 2012. Vol. 2012, no. 2012, pp.1-5.
https://search.emarefa.net/detail/BIM-510495
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-510495