The middle pivot element algorithm (Q355523): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 4 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q58905495 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.5402/2012/947634 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1967687165 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new sorting algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Software complexity: a statistical case study through insertion sort / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4519900 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:43, 6 July 2024
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
