The average case analysis of partition sorts

DOI10.1007/978-3-540-30140-0_23MaRDI QIDQ5464583zbMATH OpenOpenAlexFDO

Authors David C. Kandathil, Richard Cole

Publication date 18 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100428

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms (68W40)

Recommendations

• QuickXsort: a fast sorting scheme in theory and practice
• Optimal Partitioning for Dual Pivot Quicksort
• QuickXsort: efficient sorting with n n - 1.399n + o(n) comparisons on average
• Efficient sample sort and the average case analysis of PEsort
• scientific article; zbMATH DE number 5556016

Cited in

(7)

• Analyzing a class of distributive partitioning sort algorithms
• A select and insert sorting algorithm
• Average-case analysis of perfect sorting by reversals
• Homogeneous and non-homogeneous algorithms
• Average-case analysis of some plurality algorithms
• A note on average-case sorting
• Efficient sample sort and the average case analysis of PEsort

This page was built for publication: The average case analysis of partition sorts

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