Precision complexity analysis: A case study using insertion sort

DOI10.1016/0020-0255(93)90018-HzbMath0783.68059OpenAlexW2082648065MaRDI QIDQ1310939

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)

Related Items (1)

Homogeneous and Non-homogeneous Algorithms

Cites Work

• On some generalized farlie-gumbel-morgenstern distributions-II regression, correlation and further generalizations
• Unnamed Item
• Unnamed Item

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