Introduction to Algorithms (MIT)

This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems.

1: Algorithmic Thinking, Peak Finding

2: Models of Computation, Document Distance

3: Insertion Sort, Merge Sort

4: Heaps and Heap Sort

5: Binary Search Trees, BST Sort

6: AVL Trees, AVL Sort

7: Counting Sort, Radix Sort, Lower Bounds for Sorting

8: Hashing with Chaining

9: Table Doubling, Karp-Rabin

10: Open Addressing, Cryptographic Hashing

11: Integer Arithmetic, Karatsuba Multiplication

12: Square Roots, Newton’s Method