###### Computer Science and Engineering  Introduction to Algorithms
 List Lectures   [ 1 ]  2  3
 # Lecture Name 1 Introduction - Analysis of Algorithms, Insertion Sort, Mergesort 2 Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication 3 Quicksort, Randomized Algorithms 4 Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort 5 Order Statistics, Median 6 Hashing, Hash Functions 7 Universal Hashing, Perfect Hashing 8 Relation of BSTs to Quicksort | Analysis of Random BST 9 Red-black Trees, Rotations, Insertions, Deletions 10 Augmenting Data Structures, Dynamic Order Statistics, Interval Trees

 Title: Introduction to Algorithms Department: Computer Science and Engineering Author: // University: MIT Type: WebLink Abstract: 1. Introduction - Analysis of Algorithms, Insertion Sort, Mergesort 2. Asymptotic Notation | Recurrences | Substitution, Master Method 3. Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication 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. Relation of BSTs to Quicksort | Analysis of Random BST 10. Red-black Trees, Rotations, Insertions, Deletions 11. Augmenting Data Structures, Dynamic Order Statistics, Interval Trees 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 Trees 17. Shortest Paths I: Properties, Dijkstra 18. Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints 19. Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson 20. Advanced Topics 21. Advanced Topics (cont.) 22. Advanced Topics (cont.) 23. Advanced Topics (cont.)