The middle pivot element algorithm (Q355523): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68W05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68P10 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6191054 / rank | |||
Normal rank |
Revision as of 10:23, 28 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The middle pivot element algorithm |
scientific article |
Statements
The middle pivot element algorithm (English)
0 references
25 July 2013
0 references
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.
0 references