A simple expected running time analysis for randomized ``divide and conquer'' algorithms (Q2581554)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple expected running time analysis for randomized ``divide and conquer'' algorithms |
scientific article |
Statements
A simple expected running time analysis for randomized ``divide and conquer'' algorithms (English)
0 references
10 January 2006
0 references
Quicksort
0 references
Divide and conquer
0 references
Probabilistic recurrence
0 references
