下载了算法导论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: θ(n2)
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: θ(n lgn)
4 quick sort: average: (nlgn) worst case: θ(n2)
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