A new measure of presortedness

DOI10.1016/0890-5401(89)90050-3zbMath0679.68122OpenAlexW2043231047MaRDI QIDQ1822995

Vladimir Estivill-Castro, Derick Wood

Publication date: 1989

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(89)90050-3

zbMATH Keywords

sorting algorithmspresortednesscomparison-based model of computation

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items (14)

A framework for adaptive sorting ⋮ Randomized adaptive sorting ⋮ Computing and ranking measures of presortedness ⋮ Sorting roughly sorted sequences in parallel ⋮ An adaptive generic sorting algorithm that uses variable partitioning^∗ ⋮ An optimal parallel adaptive sorting algorithm ⋮ Splitsort -- an adaptive sorting algorithm ⋮ 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 new measure of presortedness ⋮ On partitions and presortedness of sequences

Cites Work

• River routing in VLSI
• Encroaching lists as a measure of presortedness
• Axioms and hulls
• A new measure of presortedness
• Measures of Presortedness and Optimal Sorting Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new measure of presortedness