Introduction to Algorithms (MIT)

MIT has a very important influence both in the United States and around the world. It has cultivated many people who have had a major impact on the world. It is a pioneer and leading university in global high technology and advanced research. This video tutorial mainly teaches the design and analysis skills of efficient algorithms, focusing on methods with practical value. Course topics include sorting, stacking, and hashing; individual breaking methods, dynamic programming, network flows, computational geometry, number theory algorithms, cache technology, and parallel computing.

• Chapter 1：Course Introduction and Algorithm Analysis (1 hours and 20 minutes and 35 seconds)

• Chapter 2：Asymptotic notation, recursion and solutions (1 hours and 10 minutes and 31 seconds)

• Chapter 3：divide and conquer (1) (1 hours and 8 minutes and 32 seconds)

• Chapter 4：Quick sort and randomization algorithms (1 hours and 20 minutes and 32 seconds)

• Chapter 5：Linear time sorting (1 hours and 16 minutes and 49 seconds)

• Chapter 6：Ordinal statistics, median (1 hours and 8 minutes and 48 seconds)

• Chapter 7：Hash table (1 hours and 8 minutes and 48 seconds)

• Chapter 8：Global hashing and complete hashing (1 hours and 19 minutes and 45 seconds)

• Chapter 9：binary search tree (1 hours and 21 minutes and 21 seconds)

• Chapter 10：Balanced search tree (1 hours and 23 minutes and 51 seconds)

• Chapter 11：Extended data structures, dynamic ordered statistics and interval trees (1 hours and 23 minutes and 49 seconds)

• Chapter 12：jump table (1 hours and 25 minutes and 36 seconds)

• Chapter 13：Amortized analysis, table amplification, potential energy method (1 hours and 19 minutes and 10 seconds)

• Chapter 14：Competitive analysis, self-organizing table (1 hours and 14 minutes and 32 seconds)

• Chapter 15：Dynamic programming, longest common subsequence (1 hours and 11 minutes and 4 seconds)

• Chapter 16：Greedy algorithm, minimum spanning tree (1 hours and 24 minutes and 1 seconds)

• Chapter 17：Shortest path algorithm: Dijkstra's algorithm, breadth first search (1 hours and 24 minutes and 38 seconds)

• Chapter 18：Shortest Path Algorithm: Bellman and Differential Constraint Systems (1 hours and 17 minutes and 21 seconds)

• Chapter 19：Shortest path algorithm: shortest path to point (1 hours and 15 minutes and 3 seconds)

• Chapter 20：Advanced Topic Parallel Algorithm (1) (1 hours and 15 minutes and 11 seconds)

• Chapter 21：Advanced Topic Parallel Algorithm (2) (1 hours and 16 minutes and 52 seconds)

• Chapter 22：Advanced Topic: Cache Parameter-Independent Algorithms (1 hours and 24 minutes and 52 seconds)

• Chapter 23：Cache-independent algorithm 2 (1 hours and 25 minutes and 20 seconds)