Computing and ranking measures of presortedness

DOI10.1080/00207169208804137zbMATH Open0824.68029OpenAlexW2014975866MaRDI QIDQ4323402FDOQ4323402

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)

Cites Work

• Title not available (Why is that?)
• Approximation algorithms for combinatorial problems
• On computing the length of longest increasing subsequences
• A decomposition theorem for partially ordered sets
• Measures of Presortedness and Optimal Sorting Algorithms
• How good is the information theory bound in sorting?
• Smoothsort, an alternative for sorting in situ
• A new measure of presortedness
• Title not available (Why is that?)
• Sorting roughly sorted sequences in parallel
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• Right invariant metrics and measures of presortedness

   Recommendations

• Measures of Presortedness and Optimal Sorting Algorithms 👍 👎
• Title not available (Why is that?) 👍 👎
• A new measure of presortedness 👍 👎
• A framework for adaptive sorting 👍 👎
• A framework for adaptive sorting 👍 👎

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)