MIT OpenCourseWare_Introduction_to_Algorithms_(Fall_2011)

立即下载 复制链接

Lecture 16: Dijkstra.mp4 199MB
Lecture 1:Algorithmic Thinking, Peak Finding.mp4 115MB
Lecture 18: Speeding up Dijkstra.mp4 115MB
Lecture 15: Single-Source Shortest Paths Problem.mp4 115MB
Lecture 9: Table Doubling, Karp-Rabin.mp4 114MB
Lecture 21: Dynamic Programming III: Parenthesization, Edit Distance, Knapsack.mp4 113MB
Lecture 5: Binary Search Trees, BST Sort.mp4 113MB
Lecture 4: Heaps and Heap Sort.mp4 113MB
Lecture 20: Dynamic Programming II: Text Justification, Blackjack.mp4 112MB
Lecture 7: Counting Sort, Radix Sort, Lower Bounds for Sorting.mp4 112MB
Lecture 6: AVL Trees, AVL Sort.mp4 112MB
Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths.mp4 111MB
Lecture 3: Insertion Sort, Merge Sort.mp4 110MB
Lecture 12: Square Roots, Newton's Method.mp4 110MB
Lecture 23: Computational Complexity.mp4 110MB
Lecture 8: Hashing with Chaining.mp4 110MB
Lecture 10: Open Addressing, Cryptographic Hashing.mp4 110MB
Lecture 13: Breadth-First Search (BFS).mp4 109MB
Lecture 22: Dynamic Programming IV: Guitar Fingering, Tetris, Super Mario Bros..mp4 106MB
Lecture 17: Bellman-Ford.mp4 105MB
Lecture 2: Models of Computation, Document Distance.mp4 105MB
Lecture 11: Integer Arithmetic, Karatsuba Multiplication.mp4 102MB
Lecture 24: Topics in Algorithms Research.mp4 101MB
Lecture 14: Depth-First Search (DFS), Topological Sort.mp4 9MB
list.txt~ 781B
README.txt 402B
README.txt~ 379B