On the average running time of odd-even merge sort

DOI10.1007/3-540-59042-0_99zbMATH Open1379.68111OpenAlexW1547192981MaRDI QIDQ4596647

Christine Rüb

Publication date: 4 December 2017

Published in: STACS 95 (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-0014-B6D4-5

Mathematics Subject Classification ID

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

Related Items (1)

Average merge time: an intuitive interpretation

This page was built for publication: On the average running time of odd-even merge sort

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