My work for Introduction to Algorithm at UW Madison. All assignments are completed in Python.

Each week there is a homework that has a problem that is a mini-programming that relates to the specific topic of the week. The problem is the last question of the homework. Homework PDF is provided in each week folder (except week 11 and 12 (NP-Completeness), which did not have a programming question).

All programming solution cleared all autograder tests.

Hello World.

Graph - DFS Search

Greedy Algorithm - Interval Scheduling

Greedy Algorithm - Furthest In The Future Cache

Divide and Conquer - Inversion Counting

Divide and Conquer - Line Segment Intersection

Dynamic Programming - Weighted Interval Scheduling

Dynamic Programming - Knapsack Problem

Network Flow - Ford-Fulkerson Algorithm

Network Flow - Maximum Bipartite Matching

Randomized Algorithm - Random 3-SAT