麻省理工 算法入门 (MIT 6.006, Introduction to Algorithms, Peak Finding)【英】
课程地址：https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-fall-2011/
视频地址：https://www.youtube.com/playlist?list=PLUl4u3cNGP61Oq3tWYp6V_F-5jb5L2iHb
视频选集
（1/47）
自动连播
01#Algorithmic Thinking, Peak Finding
53:22
02#Models of Computation, Document Distance
48:52
03#Insertion Sort, Merge Sort
51:20
04#Heaps and Heap Sort
52:32
05#Binary Search Trees, BST Sort
52:40
06#AVL Trees, AVL Sort
51:59
07#Counting Sort, Radix Sort, Lower Bounds for Sorting
52:09
08#Hashing with Chaining
51:16
09#Table Doubling, Karp-Rabin
52:47
10#Open Addressing, Cryptographic Hashing
50:55
11#Integer Arithmetic, Karatsuba Multiplication
47:24
12#Square Roots, Newton's Method
51:17
13#Breadth-First Search (BFS)
50:48
14#Depth-First Search (DFS), Topological Sort
50:31
15#Single-Source Shortest Paths Problem
53:15
16#Dijkstra
51:26
17#Bellman-Ford
48:51
18#Speeding up Dijkstra
53:16
19#Dynamic Programming I- Fibonacci, Shortest Paths
51:47
20#Dynamic Programming II- Text Justification, Blackjack
52:12
21#DP III- Parenthesization, Edit Distance, Knapsack
52:41
22#DP IV- Guitar Fingering, Tetris, Super Mario Bros.
49:20
23#Computational Complexity
51:12
24#Topics in Algorithms Research
46:47
R1#Asymptotic Complexity, Peak Finding
53:50
R2#Python Cost Model, Document Distance
52:21
R3#Document Distance, Insertion and Merge Sort
54:11
R5#Recursion Trees, Binary Search Trees
59:16
R6#AVL Trees
53:28
R7#Comparison Sort, Counting and Radix Sort
51:09
R8#Simulation Algorithms
55:39
R9#Rolling Hashes, Amortized Analysis
01:01:01
R9B#DNA Sequence Matching
57:28
R10#Quiz 1 Review
54:49
R11#Principles of Algorithm Design
58:26
R12#Karatsuba Multiplication, Newton's Method
53:08
R13#Breadth-First Search (BFS)
54:53
R14#Depth-First Search (DFS)
53:39
R15#Shortest Paths
56:31
R16#Rubik's Cube, StarCraft Zero
54:36
R18#Quiz 2 Review
01:05:30
R19#Dynamic Programming- Crazy Eights, Shortest Path
52:48
R20#Dynamic Programming- Blackjack
52:58
R21#Dynamic Programming- Knapsack Problem
01:09:12
R22#Dynamic Programming- Dance Dance Revolution
53:16
R23#Computational Complexity
47:14
R24#Final Exam Review
51:44
618年中钜惠！学到就是赚到
购课抽B站周边 单课至高返现200元
顶部