Adaptive shivers sort: an alternative sorting algorithm

DOI10.1145/3664195MaRDI QIDQ7023542zbMATH OpenFDO

Authors Vincent Jugé

Publication date 21 February 2025

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

adaptive ShiversSortapproximabilityentropymerge sortssorting algorithmsworst-case complexity

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Cites work

• A New Algorithm for Minimum Cost Binary Trees
• Adaptive Shivers Sort: An Alternative Sorting Algorithm
• scientific article; zbMATH DE number 3827217 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• Measures of Presortedness and Optimal Sorting Algorithms
• Nearly-optimal mergesorts: fast, practical sorting methods that optimally adapt to existing runs
• On compressing permutations and adaptive sorting
• On the worst-case complexity of TimSort
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Partial Solution and Entropy
• Queue-mergesort
• Strategies for stable merge sorting

Cited in

(1)

• Galloping in fast-growth natural merge sorts

This page was built for publication: Adaptive shivers sort: an alternative sorting algorithm

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