On partitions and presortedness of sequences

DOI10.1007/BF01185681MaRDI QIDQ808689zbMATH OpenOpenAlexFDO

Authors Svante Carlsson, Jingsen Chen

Publication date 1992

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01185681

zbMATH Keywords

partitioningpresortednessoptimal sorting strategies

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 3943040
• Measures of Presortedness and Optimal Sorting Algorithms
• A new measure of presortedness
• A framework for adaptive sorting
• A framework for adaptive sorting

Cites work

• scientific article; zbMATH DE number 4213426 (Why is no real title available?)
• scientific article; zbMATH DE number 3614186 (Why is no real title available?)
• scientific article; zbMATH DE number 3997796 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A decomposition theorem for partially ordered sets
• A new measure of presortedness
• Encroaching lists as a measure of presortedness
• Exploiting partial order with Quicksort
• Measures of Presortedness and Optimal Sorting Algorithms
• Smoothsort's behavior on presorted sequences
• Smoothsort, an alternative for sorting in situ
• The Ultimate Planar Convex Hull Algorithm?

Cited in

(4)

• Encroaching lists as a measure of presortedness
• Measures of Presortedness and Optimal Sorting Algorithms
• scientific article; zbMATH DE number 1741785 (Why is no real title available?)
• scientific article; zbMATH DE number 3943040 (Why is no real title available?)

This page was built for publication: On partitions and presortedness of sequences

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