Introduction to Algorithms

1. Algorithms, Insertion Sort, Mergesort	2. Asymptotic Notation | Recurrences | Substitution,	3.Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multi	4 Quicksort, Randomized Algorithms	5.Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort
6.Order Statistics, Median	7.Hashing, Hash Functions	8.Universal Hashing, Perfect Hashing	9 Universal Hashing, Perfect Hashing	10 Trees, Rotations, Insertions, Deletions
11  Data Structures, Dynamic Order	12 Skip Lists	13. Amortized Algorithms, Table Doubling, Potential Method	14 Competitive Analysis: Self-organizing Lists	15 Dynamic Programming, Longest Common Subsequence
16. Greedy Algorithms, Minimum Spanning	17. Shortest Paths I: Properties, Dijkstra	18. Shortest Paths II: Bellman-Ford, Linear Programming,	19.Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall,	20. Advanced Topics
21. Advanced Topics	22. Advanced Topics (cont.)	23. Advanced Topics (cont.)