This repo contains all the code I wrote for the Coursera Algorithms Specialty, consisting of 4 4-week long courses taught by Tim Roughgarden of Stanford University.
There are 4 courses:
- 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