PROGRESS.md

Progress

MIT 6.006 Spring 2020

Phase 1 — Foundations

• L1 Introduction
• L2 Data Structures
• L3 Sorting
• L4 Hashing
• L5 Linear Sorting
• PS0
• PS1
• PS2

Phase 2 — Trees / Heap

• L6 Binary Trees I
• L7 Binary Trees II: AVL
• L8 Binary Heaps
• PS3
• PS4
• C++ BST from scratch
• C++ AVL from scratch
• C++ Heap from scratch

Phase 3 — Graph Traversal

• L9 BFS
• L10 DFS
• C++ Graph adjacency list
• C++ BFS / DFS
• C++ Union-Find
• Topological Sort

Phase 4 — Shortest Paths

• L11 Weighted Shortest Paths
• L12 Bellman-Ford
• L13 Dijkstra
• L14 Johnson
• PS5
• PS6
• Bellman-Ford from scratch
• Dijkstra from scratch
• Kruskal from scratch
• Prim from scratch

Phase 5 — Dynamic Programming

• L15 DP I
• L16 DP II
• L17 DP III
• L18 DP IV
• PS7

Phase 6 — Complexity / Review

• L19 Complexity
• L20 Review
• L21 Next Steps
• PS8
• Quiz 1
• Quiz 2
• Quiz 3
• Final

国内课程补丁

• Huffman Tree
• KMP
• Floyd-Warshall
• MST: Prim / Kruskal
• Union-Find
• Sorting stability / complexity table
• adjacency matrix / adjacency list

Ready for CS336 checkpoint

满足以下条件即可开始并行 CS336：

• Hashing understood + implemented
• BST implemented
• Heap implemented
• BFS / DFS implemented
• Dijkstra implemented
• Bellman-Ford understood
• 能独立分析常见算法复杂度