Personal repo of course CS208 Algorithm Design
- Lab01: Stable match
- Lab02: Stable match Cont.
- Lab03: Breadth first search
- Lab04: Directed acyclic graph topological sort
- Lab05: Greedy algorithm
- Lab06: Greedy algorithm: least recent used
- Lab07: Huffman coding
- Lab08: Divide and conquer: statistical reverse
- Lab09: Divide and conquer: nearest point pair
- Lab10: Divide and conquer: fast fourier transform
- Lab11: Dynamic planning: least squares
- Lab12: Dynamic planning: knapsack problem