A statistical analysis of an algorithm's complexity

DOI10.1016/S0893-9659(00)00043-4zbMATH Open0965.68139OpenAlexW2054071769MaRDI QIDQ1585523FDOQ1585523

Authors: R. Smith 

Publication date: 16 November 2000

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(00)00043-4

Recommendations

• Software complexity: a statistical case study through insertion sort
• scientific article; zbMATH DE number 2219109
• A mixed evolutionary-statistical analysis of an algorithm's complexity
• Statistical Analysis of Computational Tests of Algorithms and Heuristics
• On the heap sort algorithm

zbMATH Keywords

bubble sort program

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• How many passes does the bubble sort make when the input is a pps sample with replacement? A study in simulation
• Software complexity: a statistical case study through insertion sort
• A simple empirical formula for categorizing computing operations
• Replacement sort revisited: The ``gold standard unearthed!
• On why an algorithmic time complexity measure can be system invariant rather than system independent
• Winograd's algorithm statistically revisited: it pays to weigh than to count!
• Generation techniques for linear programming instances with controllable properties
• Can statistics provide a realistic measure for an algorithm's complexity?
• A mixed evolutionary-statistical analysis of an algorithm's complexity

This page was built for publication: A statistical analysis of an algorithm's complexity

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