A general method for improving insertion-based adaptive sorting

DOI10.1007/978-3-642-35261-4_25MaRDI QIDQ4909539zbMATH OpenOpenAlexFDO

Authors Riku Saikkonen, Eljas Soisalon-Soininen

Publication date 21 March 2013

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35261-4_25

zbMATH Keywords

adaptive sortingmeasures of presortednesssearch trees

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• A framework for adaptive sorting
• A framework for adaptive sorting
• Measures of Presortedness and Optimal Sorting Algorithms
• scientific article; zbMATH DE number 3943040
• Splitsort -- an adaptive sorting algorithm

Cited in

(12)

• Splitsort -- an adaptive sorting algorithm
• A generalized insertion algorithm for the seriation problem
• A framework for adaptive sorting
• Adaptive search over sorted sets
• An adaptive generic sorting algorithm that uses variable partitioning^∗
• scientific article; zbMATH DE number 4155867 (Why is no real title available?)
• scientific article; zbMATH DE number 5630647 (Why is no real title available?)
• Randomized adaptive sorting
• Adaptive Heapsort
• A framework for adaptive sorting
• scientific article; zbMATH DE number 5051648 (Why is no real title available?)
• scientific article; zbMATH DE number 2219109 (Why is no real title available?)

This page was built for publication: A general method for improving insertion-based adaptive sorting

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