Precision complexity analysis: A case study using insertion sort

DOI10.1016/0020-0255(93)90018-HMaRDI QIDQ1310939zbMATH OpenOpenAlexFDO

Authors Bernard A. Nadel

Publication date 20 March 1994

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(93)90018-h

zbMATH Keywords

inhomogeneityexact case complexityimprecision of an analysismedium classesperfectly homogeneoussingleton classessmall classestiny classes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Homogeneous and non-homogeneous algorithms
• Towards a realistic analysis of some popular sorting algorithms
• A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms
• Replacement sort revisited: The ``gold standard unearthed!
• A select and insert sorting algorithm

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3481857 (Why is no real title available?)
• On some generalized farlie-gumbel-morgenstern distributions-II regression, correlation and further generalizations

Cited in

(3)

• scientific article; zbMATH DE number 2219109 (Why is no real title available?)
• Homogeneous and non-homogeneous algorithms
• scientific article; zbMATH DE number 5051648 (Why is no real title available?)

This page was built for publication: Precision complexity analysis: A case study using insertion sort

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