Computing and ranking measures of presortedness

DOI10.1080/00207169208804137MaRDI QIDQ4323402zbMATH OpenOpenAlexFDO

Authors Jingsen Chen

Publication date 6 November 1995

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169208804137

zbMATH Keywords

sorting algorithmpresortedness

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Searching and sorting (68P10)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 432806 (Why is no real title available?)
• scientific article; zbMATH DE number 4213426 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• A decomposition theorem for partially ordered sets
• A new measure of presortedness
• Approximation algorithms for combinatorial problems
• How good is the information theory bound in sorting?
• Measures of Presortedness and Optimal Sorting Algorithms
• On computing the length of longest increasing subsequences
• Smoothsort, an alternative for sorting in situ
• Sorting roughly sorted sequences in parallel

Cited in

(4)

• scientific article; zbMATH DE number 1157599 (Why is no real title available?)
• A new measure of presortedness
• Generating nearly sorted sequences -- the use of measures of disorder
• Right invariant metrics and measures of presortedness

This page was built for publication: Computing and ranking measures of presortedness

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