The middle pivot element algorithm

DOI10.5402/2012/947634zbMATH Open1268.68167OpenAlexW1967687165WikidataQ58905495 ScholiaQ58905495MaRDI QIDQ355523FDOQ355523

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A new sorting algorithm
• 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)