###COS226

https://www.coursera.org/learn/algorithms-part1/home

https://www.coursera.org/learn/algorithms-part2/home

the courses origin web site is here: https://www.cs.princeton.edu/courses/archive/spring19/cos226/

my blog site: https://www.jianshu.com/nb/38792095

In coursera, I found the quiz part has worst experience.

so I decide to try my best to make up for this deficiency.

Every Quiz problem, I will build a class and a test to verify the correctness.

• Week 1: union find (all 3 quiz, 1 project with 0 failed, 100 score with bonus; Aggregate score: 101.25%)
• Week 1: analysis of alogorithm (all 3 quiz)
• Week 2: stack queue (all 3 quiz, 1 project with 0 failed, 100 score with bonus; Aggregate score: 100.08%)
• Week 2: elementary sort (all 3 quiz)
• Week 3: merge sort (all 3 quiz, 1 project with 0 failed, 100 score; Aggregate score: 100%)
• Week 3: quick sort (all 3 quiz)
• Week 4: priority queue (all 3 quiz, 1 project with 0 failed, 100 score with solve 4x4-49; Aggregate score: 100%)
• Week 4: symbol table (3 quiz)
• Week 5: balance search tree (all 3 quiz)
• Week 5: geometric search (4 extra credit, 1 project with 0 failed, 100 score without rectHV in node)
• Week 6: hash table (all 2 quiz)
• Week 7: undirected graph (all 3 quiz)
• Week 7: directed graph (all 3 quiz, 1 project with 0 failed, 100 score with all bonus; Aggregate score: 106.67%)
• Week 8: minimum spanning tree (all 3 quiz, 1 extra credit)
• Week 8: shortest path (all 3 quiz, 3 extra credit, 1 project with 0 failed, 100 score with all bonus; Aggregate score: 103.53%)
• Week 9: max flow (3 quiz, 1 extra credit, 1 project with 0 failed, Aggregate score: 100.00%)
• Week 9: radix sort (all 3 quiz, 1 extra credit)
• Week 10: trie (1 quiz, 2 extra credit)
• Week 10: substring search (all 3 quiz, 1 extra credit, 1 project with 0 failed, 100 score with all bonus; Aggregate score: 102.22%)
• Week 11: regular expression (all 3 quiz)
• Week 11: data compression (2 quiz, 1 extra credit, 1 project with 0 failed; Aggregate score: 100.00%)
• Week 12: reduction (3 quiz)

• Week 1: Percolation project: memory bonus
• Week 2: elementary sort: jarvis convex hull algorithm
• Week 2: randomized queue project: memory bonus
• Week 4: priority queue: event driven simulation
• Week 4: 8 puzzle project: IDA* solve puzzle4x4-78.txt and puzzle4x4-80.txt
• Week 4: symbol table: morris preorder
• Week 5: intervalST, RangeSearchBST, RectangleIntersection, LineSegmentIntersection, SegmentTree
• Week 5: K-d Tree project: memory bonus
• Week 7: Word net project: 9 timing bonus
• Week 8: minimum spanning tree : eager prim
• Week 8: shortest path: arbitrage detection, campus bike ii, parallel job scheduling
• Week 8: seam carving project: 3 timing bonus
• Week 9: max flow: bipartite matching
• Week 9: radix sort: manber myer suffix array
• Week 10: trie: longest prefix, t9 texting
• Week 10: substring search: search multiple pattern, boyer moore
• Week 10: boggle game project: 1 timing bonus
• Week 11: data compression: LZW implementation
• Week 11: burrows wheeler project: better circular suffix array