Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm

DOI10.1007/s10852-008-9089-6zbMath1191.68230MaRDI QIDQ1040789

J. Blot

Publication date: 25 November 2009

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-008-9089-6

zbMATH Keywords

randomized algorithms; fault-tolerant sorting; inversion pair cardinality; randomized QuickMergesort

Mathematics Subject Classification ID

68P10: Searching and sorting

68M15: Reliability, testing and fault tolerance of networks and computer systems

68W20: Randomized algorithms

Uses Software

• Quicksort