算法导论---顺序统计、中值

给定一个序列A[1…n]，寻找第 k 小元素

借用随机快排的 partition 函数

Rand_Select(A, p, r, i)  // from A[p] to A[r] to find the element of number i
  if p = q then return A[p]

  r = Rand_Partition(A, p, q)
  k = r - q + 1 // k = rank(A[r]) in A[p…q]
  if i==k then return A[r]
  if i<k then
    return Rand_Select(A, p, r-1, i)
  else
    return Rand_Select(A, r+1, q, i-k)

• analysis
  (assume elements are distinct)
  lucky case 1/10 9/10:
   T(n) = T(9/10 $\times$ n) + Θ(n)
     = Θ(n)
  unlucky case 0 n-1
   T(n) = T(n-1) + Θ(n)
     = Θ(n²)
  
  期望运行时间：
  令T(n) 为一个随机变量
  定义指示器随机变量 X_k，k=0,1,2…
  $$X_k=\{\begin{array}{ll}1& 数组被分割成k和n-k+1两段\\ 0& 其他\end{array}$$

$$T(n)=\{\begin{array}{l}T(\end{array}$$