Resources for the Study of Algorithms

Algorithm Design Techniques and Problems

1. Techniques for analyzing algorithms
2. Proving the correctness of algorithms
3. Problems with linear or sublinear complexity
4. Divide and conquer method, searching and sorting
5. Greedy method
6. Dynamic programming
7. Algorithms on graphs
8. Backtracking
9. Network flows
10. NP-completeness and approximation algorithms
11. Coding interview questions

General resources

1. Guidelines for writing solutions

Notes

1. Correctness proof for Dijkstra's shortest-path algorithm
2. Scheduling events to minimize the number of rooms
3. Makespan problem --- approximation algorithm
4. Weighted vertex cover --- approximation algorithm using layering method by Yatharth Saraf

Books and Online Materials