1. In bubble sort, the size of the problem is reduced to n-k after k rounds of sweep & swap.
  2. For a vector of size n, the optimal time complexity for binary search versions A and B is Θ(1),Θ(log2n).

  3. If the distribution of elements in an (ordered) vector satisfies an independent uniform distribution (before sorting), the average time complexity of the interpolation search is:O(loglogn).

  4. Merge sort: time O(nlog2n), space O(log2n) 

  5. 无序列表的寻秩访问：O（n）

  6. 无序列表的查找：O（n）

  7. 放假啊了

  8. 附近的啦

  9.