A simple expected running time analysis for randomized ``divide and conquer'' algorithms (Q2581554)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2244807
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple expected running time analysis for randomized ``divide and conquer'' algorithms |
scientific article; zbMATH DE number 2244807 |
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
0.8213082551956177
0 references
0.8073840141296387
0 references
0.7959566116333008
0 references
0.7877883911132812
0 references
0.7834306359291077
0 references
