文章基本信息

标题：The Middle Pivot Element Algorithm
本地全文：下载
作者：Anchala Kumari ; Soubhik Chakraborty
期刊名称：ISRN Computational Mathematics
电子版ISSN：2090-7842
出版年度：2012
卷号：2012
DOI：10.5402/2012/947634
出版社：Hindawi Publishing Corporation
摘要：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.