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. Bubble Sort
9. Brute Force
10. Divide and Conquer Technique
11. Topological Sort
12. Decrease and Conquer
13. Transform and Conquer
14. Space and Time Tradeoffs
15. Heaps and Heap Sort
16. Greedy Programming Technique
17. Huffman Encoding
18. Minimum Spanning Trees
19. Single Source Shortest Path
20. Union of disjoint sets and finding the partition
21. Fractional Knapsack
22. Dynamic Programming
23. Iterative Improvement
24. Limitations of Algorithms
25. Cheat Sheet PS PDF
26. Note