Open AccessThe Middle Pivot Element Algorithm
Author(s) -
Anchala Kumari,
Soubhik Chakraborty
Publication year - 2012
Publication title -
isrn computational mathematics
Language(s) - English
Resource type - Journals
ISSN - 2090-7842
DOI - 10.5402/2012/947634
Subject(s) - element (criminal law) , sorting , algorithm , computer science , sorting algorithm , mathematics , political science , law
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom