A simple expected running time analysis for randomized ``divide and conquer algorithms

DOI10.1016/J.DAM.2005.07.005zbMath1083.68149DBLPjournals/dam/Dean06OpenAlexW2050001863WikidataQ30000112 ScholiaQ30000112MaRDI QIDQ2581554

Brian C. Dean

Publication date: 10 January 2006

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

Full work available at URL: https://doi.org/10.1016/j.dam.2005.07.005

zbMATH Keywords

QuicksortDivide and conquerProbabilistic recurrence

Mathematics Subject Classification ID

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

Related Items (1)

Group testing: Revisiting the ideas

Uses Software

• Quicksort
• Find

Cites Work

• Unnamed Item
• Quicksort

This page was built for publication: A simple expected running time analysis for randomized ``divide and conquer algorithms