Lecture Notes

1. Introduction and PRELIMINARIES
2. The Growth of Functions
3. Recurrences
4. Fundamental Data Structures
5. Lists
Graphs
6. Trees
7. Priority Queues
8. Divide and Conquer Technique
9. Transform and Conquer
10. Heaps and Heap Sort
11. Bubble Sort
12. Space and Time Tradeoffs
13. Decrease and Conquer
14. Topological Sort
15. Greedy Programming Technique
16. Fractional Knapsack
17. Huffman Encoding
18. Union of disjoint sets and finding the partition
19. Minimum Spanning Trees
20. Single Source Shortest Path
21. Iterative Improvement
22. Dynamic Programming
23. Backtracking 
24. Brute Force
25. Limitations of Algorithms
26. Cheat Sheet PS PDF