On partitions and presortedness of sequences
From MaRDI portal
Publication:808689
DOI10.1007/BF01185681zbMath0732.68030OpenAlexW3137780216MaRDI QIDQ808689
Publication date: 1992
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01185681
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Encroaching lists as a measure of presortedness
- Smoothsort, an alternative for sorting in situ
- A new measure of presortedness
- Smoothsort's behavior on presorted sequences
- A decomposition theorem for partially ordered sets
- Measures of Presortedness and Optimal Sorting Algorithms
- Exploiting partial order with Quicksort
- The Ultimate Planar Convex Hull Algorithm?