Replacement sort revisited: The ``gold standard unearthed!

DOI10.1016/j.amc.2006.11.093zbMath1122.68045OpenAlexW1967550908MaRDI QIDQ2381333

Kumar Sushant, Suman Kumar Sourabh, Mausumi Bose, Soubhik Chakraborty

Publication date: 17 September 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.11.093

zbMATH Keywords

algorithmic complexityaverage complexity

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10)

Related Items (3)

Winograd's algorithm statistically revisited: it pays to weigh than to count! ⋮ Software complexity: a statistical case study through insertion sort ⋮ On why an algorithmic time complexity measure can be system invariant rather than system independent

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A statistical analysis of an algorithm's complexity
• How robust are average complexity measures? A statistical case study

This page was built for publication: Replacement sort revisited: The ``gold standard unearthed!