Inversion-sensitive sorting algorithms in practice

DOI10.1145/1412228.1455267MaRDI QIDQ5406181zbMATH OpenOpenAlexFDO

Authors Amr Elmasry, Abdelrahman Hammad

Publication date 1 April 2014

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1412228.1455267

zbMATH Keywords

adaptive sortinginversions

Mathematics Subject Classification ID

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

Recommendations

• Experimental and Efficient Algorithms
• Automata, Languages and Programming
• scientific article; zbMATH DE number 2163028
• Adaptive sorting: an information theoretic perspective
• scientific article; zbMATH DE number 1962852

Cited in

(7)

• An introduction to three algorithms for sorting in situ
• The weak-heap data structure: variants and applications
• Complexity analysis and performance of double hashing sort algorithm
• scientific article; zbMATH DE number 2163028 (Why is no real title available?)
• Nearly-optimal mergesorts: fast, practical sorting methods that optimally adapt to existing runs
• Experimental and Efficient Algorithms
• Automata, Languages and Programming

This page was built for publication: Inversion-sensitive sorting algorithms in practice

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