The middle pivot element algorithm

DOI10.5402/2012/947634MaRDI QIDQ355523zbMATH OpenOpenAlexWikidataFDO

Authors Anchala Kumari, Soubhik Chakraborty

Publication date 25 July 2013

Published in ISRN Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5402/2012/947634

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

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.

Recommendations

• A new parallel sorting algorithm based upon min-mid-max operations
• How good is multi-pivot quicksort?
• Analysis of Hoare's FIND algorithm with Median-of-three partition
• Analysis of multiple quickselect variants.
• scientific article; zbMATH DE number 1268192

Cites work

• A new sorting algorithm
• scientific article; zbMATH DE number 1540682 (Why is no real title available?)
• Software complexity: a statistical case study through insertion sort

This page was built for publication: The middle pivot element algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q355523)