DS 学习 - 打卡贴【欢迎指教】

11-7-2016

Week 6 programming 1 in Algorithms: Design and Analysis, Part 1
-  2 sum.  tried both hashing table and sort.  running time are almost same for this case.

11-8-2016

Finished Week 6 in Algorithms: Design and Analysis, Part 1

11-9-2016

read chapter 7.1-7.5 in book - Introduction to statistical learning

11-10-2016

Finished Week 7 in Algorithms: Design and Analysis, Part 1

11-11-2016

Week 1 Lecture in Algorithms: Design and Analysis, Part 2
-  greedy algo

11-12-2016

Week 1 Lecture in Algorithms: Design and Analysis, Part 2
-  Prim's MST

11-13-2016

Finish Week 1 in Algorithms: Design and Analysis, Part 2
-  quiz and programming

11-14-2016

Week 2 lecture in Algorithms: Design and Analysis, Part 2
-  Kruskal's MST algo, Clustering algo

11-15-2016

Week 2 lecture in Algorithms: Design and Analysis, Part 2
-  Union-Find, Lazy Union, Union by rank, Path compression and analysis

11-16-2016

Finish Week 2 programming in Algorithms: Design and Analysis, Part 2
-  download UnionFind.py from https://www.ics.uci.edu/~eppstein/PADS/
-  implement single-link clustering, use greedy algo for small number of nodes, but a different approach for large number of nodes