Sciweavers

DAM
2006
79views more  DAM 2006»
13 years 4 months ago
A simple expected running time analysis for randomized "divide and conquer" algorithms
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
Brian C. Dean