a********e
发帖数: 79 | |
l*********s
发帖数: 5409 | |
d**s
发帖数: 98 | |
a********e
发帖数: 79 | |
l*********s
发帖数: 5409 | 5 我觉得很好。很有深度，不愧是名校。不过都公开课了，怎么赚钱呢？
【在 a********e 的大作中提到】
: 有看过的吗？说说怎样？
|
a********e
发帖数: 79 | |
r*******n
发帖数: 3020 | |
r*******n
发帖数: 3020 | |
a********e
发帖数: 79 | 9 写点听课笔记吧。
lecture one：
two examples: interstion sort and merge sort.
Analyze the running time.
Asymptotically analysis.
Big O notation.
Recursion tree and get the running time for merge sort.
lecture two:
More rigorous for the material for lecture one.
big O \Theta \Omega small o \omega notation.
Recursion tree method.
Master theorem (sketch of proof).
lecture three:
Divide and conquer.
Examples:
1. Binary search
2. X^n
3. Finbonacci
4. Matrix multiplication and Strassen's algorithm
5. VLSI layout problem.
lecture four:
Quick sort.
algorithm and psudo code.
analyze in different case. (best, worst,average)
randomized quicksort and analysis including the proof. |
r****y
发帖数: 26819 | 10 听到dynamic programming那集就没声音了。
【在 a********e 的大作中提到】
: 写点听课笔记吧。
: lecture one：
: two examples: interstion sort and merge sort.
: Analyze the running time.
: Asymptotically analysis.
: Big O notation.
: Recursion tree and get the running time for merge sort.
: lecture two:
: More rigorous for the material for lecture one.
: big O \Theta \Omega small o \omega notation.
|
a********e
发帖数: 79 | 11 you can change some setting in your computer to get louder.
Since the noise is quite little, I find the quality is quite
good.
【在 r****y 的大作中提到】
: 听到dynamic programming那集就没声音了。
|
a********e
发帖数: 79 | 12 lecture 5
Deeper discuss on sorting alg.
Using comparison tree model, prove the comparison
sorting cannot better than nlgn.
Introduce non-comparison alg.
counting sort
radix sort, analyze running time. |
