This repository is assignments of Stanford-University-Algorithms from Coursera by professor Tim Roughgarden.
- Divide and Conquer, Sorting and Searching, and Randomized Algorithms
- Graph Search, Shortest Paths, and Data Structures
- Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
- Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
- Assignment 1: Karatsuba Algorithm - 2 64-Digits Numbers Multiplication
- Assignment 2: Merge Sort
- Assignment 3: QuickSort - First, Last and Median as Pivot
- Assignment 4: Karger's Min Cut
- Assignment 1: Kosaraju's Algorithm - Strongly Connected Components
- Assignment 2: Dijkstra's Algorithm
- Assignment 3: Median Maintenance Algorithm
- Assignment 4: Two-Sum Algorithm
- Assignment 1: Greedy Algorithm & Prim's Algorithm
- Assignment 2: Kruskal's Algorithm & Clustering Algorithm
- Assignment 3: Huffman's Algorithm & Maximum Weight Independent Set
- Assignment 4: Knapsack Problem
- Assignment 1: Bellman-Ford Algorithm - Detecting Negative Cycle
- Assignment 2: Traveling Salesman Problem
- Assignment 3: Traveling Salesman Problem - Nearest Neighbor Heuristic
- Assignment 4: 2-SAT Problems with SCC method