下載了演算法導論2th的電子書籍 和 mit演算法導論教學視訊

對自己的要求是：做簡單的筆記，看著簡要筆記，能否知道對應內容含義，應用情況。

當前看了1--6 [共24課，每課1：20]

做筆記如下：

1 Master method

2 Sort algorithm

  Give the explanation of every sort algorithm

1 insert sort:

2 merge sort: T(n)=2T(n/2)+ θ(n). Worst case: θ(n lgn)

3 heap sort: worst case: θ(n lgn)

4 quick sort:average: (nlgn)worst case:

SORTING IN LINEAR TIME

5 counting sort

6 decision tree

7 radix sort [digit-by-digit sort]

The ith order statistic of a set of n elements is the ith smallest element

  Give the explanation of every sort algorithm

1 insert sort:

2 merge sort: T(n)=2T(n/2)+ θ(n). Worst case: θ(n lgn)

3 heap sort: worst case:

4 quick sort:average: (nlgn)worst case: θ(n²)

SORTING IN LINEAR TIME

5 counting sort

6 decision tree

7 radix sort [digit-by-digit sort]

The ith order statistic of a set of n elements is the ith smallest element