Lecture Notes

1. Introduction and PRELIMINARIES
2. The Growth of Functions
3. Recurrences
4. Data Structures
5. Lists
6. Graphs
7. Trees
8. Priority Queues
9. Divide and Conquer Technique
10. Transform and Conquer Technique
11. Heaps and Heap Sort
12. Bubble Sort
13. Other Sorting Algorithms
14. Decrease and Conquer Programming Technique
15. Topological Sort
16. Greedy Programming Technique
17. Fractional Knapsack
18. Huffman Encoding
19. Minimum Spanning Trees
20. Union of disjoint sets and finding the partition
21. Single Source Shortest Path
22. Dynamic Programming
23. Dynamic Programming -- Transitive closure and other Graph algorithms
24. Space and Time Tradeoff - Pattern Matching
25. Hash Tables
26. Limitations of Algorithm Power
27. P and NP
28. Cheat Sheet PS PDF