Average merge time: an intuitive interpretation

MaRDI QIDQ2843627zbMATH OpenFDO

Authors Michael O'Keeffe, M. Schellekens

Publication date 23 August 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066104807709

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Recommendations

• Expected time analysis of interpolation merge -- a simple new merging algorithm
• Optimal expected-time algorithms for merging
• On the average running time of odd-even merge sort
• On the Average Running Time of Odd–Even Merge Sort
• The Average Complexity of Parallel Comparison Merging
• scientific article; zbMATH DE number 3894473
• On the average case of MergeInsertion
• On the average case of MergeInsertion
• Average-case analysis of the merging algorithm of Hwang and Lin
• Waiting Times at Very Fast, Constant Service Time Merger Nodes

This page was built for publication: Average merge time: an intuitive interpretation

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