On partitions and presortedness of sequences

DOI10.1007/BF01185681zbMATH Open0732.68030OpenAlexW3137780216MaRDI QIDQ808689FDOQ808689

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

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

zbMATH Keywords

partitioningpresortednessoptimal sorting strategies

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• A decomposition theorem for partially ordered sets
• The Ultimate Planar Convex Hull Algorithm?
• Measures of Presortedness and Optimal Sorting Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Encroaching lists as a measure of presortedness
• Smoothsort, an alternative for sorting in situ
• A new measure of presortedness
• Title not available (Why is that?)
• Smoothsort's behavior on presorted sequences
• Exploiting partial order with Quicksort

Cited In (4)

• Encroaching lists as a measure of presortedness
• Measures of Presortedness and Optimal Sorting Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)

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)