Stochastic analysis of the Merge-Sort algorithm

DOI<81::AID-RSA3>3.0.CO;2-Q 10.1002/(SICI)1098-2418(199708)11:1<81::AID-RSA3>3.0.CO;2-QzbMath0882.68049OpenAlexW2088313573MaRDI QIDQ4350886

No author found.

Publication date: 4 February 1998

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199708)11:1<81::aid-rsa3>3.0.co;2-q

zbMATH Keywords

contraction methodMerge-Sort algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Sums of independent random variables; random walks (60G50)

Related Items (1)

A general limit theorem for recursive algorithms and combinatorial structures

This page was built for publication: Stochastic analysis of the Merge-Sort algorithm