Measures of Presortedness and Optimal Sorting Algorithms
From MaRDI portal
Publication:3219783
DOI10.1109/TC.1985.5009382zbMath0556.68031MaRDI QIDQ3219783
Publication date: 1985
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Related Items (29)
Sublinear merging and natural mergesort ⋮ A framework for adaptive sorting ⋮ Partial Solution and Entropy ⋮ Badness of Serial Fit Revisited ⋮ Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement ⋮ Exploiting few inversions when sorting: Sequential and parallel algorithms ⋮ Measures of distinctness for random partitions and compositions of an integer ⋮ On compressing permutations and adaptive sorting ⋮ Randomized adaptive sorting ⋮ Computing and ranking measures of presortedness ⋮ Unnamed Item ⋮ Sorting roughly sorted sequences in parallel ⋮ Recursive merge sort with erroneous comparisons ⋮ An adaptive generic sorting algorithm that uses variable partitioning∗ ⋮ An optimal parallel adaptive sorting algorithm ⋮ Splitsort -- an adaptive sorting algorithm ⋮ A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem ⋮ Computing inversion pair cardinality through partition-based sorting ⋮ Arranging \(n\) distinct numbers on a line or a circle to reach extreme total variations ⋮ Adaptive sorting: an information theoretic perspective ⋮ Right invariant metrics and measures of presortedness ⋮ A note on adaptive parallel sorting ⋮ Sorting shuffled monotone sequences ⋮ A framework for adaptive sorting ⋮ A selectable sloppy heap ⋮ A new measure of presortedness ⋮ Presorting algorithms: an average-case point of view ⋮ From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures ⋮ On partitions and presortedness of sequences
This page was built for publication: Measures of Presortedness and Optimal Sorting Algorithms
