Increasing the Efficiency of Existing Sorting Algorithms by Using Randomized Wrappers

DOI10.1093/COMJNL/46.5.498MaRDI QIDQ4474741zbMATHOpenAlexFDO

Authors A. V. Gerbessiotis, C. J. Siniolakis

Publication date 12 July 2004

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/8626bafe042ab3874466175986b3bd63de9674be

Mathematics Subject Classification ID

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

Recommendations

• Optimizing sorting algorithms by using sorting networks
• Randomized adaptive sorting
• QuickHeapsort, an efficient mix of classical sorting algorithms
• scientific article; zbMATH DE number 1857637
• A randomized parallel sorting algorithm with an experimental study

Cited in

(1)

• Randomized adaptive sorting

This page was built for publication: Increasing the Efficiency of Existing Sorting Algorithms by Using Randomized Wrappers

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