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 into two subproblems of size k and n - k that are solved recursively. We present a simple combinatorial method for analyzing the expected running time of such algorithms, and prove that under very weak assumptions this expected running time will be asymptotically equivalent to the running time obtained when problems are always split evenly into two subproblems of size n/2.
[1] C. A. R. Hoare. Algorithm 63: partition , 1961, CACM.
[2] C. A. R. Hoare,et al. Algorithm 64: Quicksort , 1961, Commun. ACM.
[3] Richard M. Karp,et al. Probabilistic recurrence relations , 1994, JACM.
[4] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .
[5] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .